Accelerating Machine Optimisation Processes

ABSTRACT

A method for training learned hierarchical algorithms, the method comprising the steps of receiving input data and generating metrics from the input data. At least one hierarchical algorithm is then selected from a plurality of predetermined hierarchical algorithms based on comparing the generated metrics from the input data and like metrics for each of the plurality of predetermined hierarchical algorithms. The selected hierarchical algorithm is developed based on the input data and the developed hierarchical algorithm is outputted.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation of, and claims priority to, International PatentApplication No. PCT/GB2016/050427, filed Feb. 19, 2016, which in turnclaims priority to the following United Kingdom applications:

GB 1519425.1, filed Nov. 3, 2015;

GB 1519687.6, filed Nov. 6, 2015;

GB 1502753.5, filed Feb. 19, 2015;

GB 1508742.2, filed May 21, 2015;

GB 1511231.1, filed Jun. 25, 2015;

GB 1507141.8, filed Apr. 27, 2015;

GB 1503427.5, filed Feb. 27, 2015; and

GB 1505544.5, filed Mar. 31, 2015,

all of which are incorporated herein by reference.

TECHNICAL FIELD

Disclosed implementations relate to methods of developing a learnedhierarchical algorithm. Specifically, a hierarchical algorithm isselected based on predetermined metrics and developed before beingoutputted.

BACKGROUND Increase in Quality of Video and Display Technology

Developments in display technology have led to significant improvementsin the resolution able to be displayed on display hardware, such as ontelevisions, on computer monitors and using video projectors. Forexample, television screens that are able to display “High Definition”or “HD” resolution content (typically having a resolution of 1920×1080pixels) have been broadly adopted by consumers. More recently,television screens able to display Ultra High Definition or “Ultra HD”resolution content (typically having a resolution over 3840×2160 pixels)are starting to become more widespread.

In contrast, HD resolution video content is only now becomingcommonplace and most legacy content is only available at either DigitalVersatile Disc Video (or “DVD-Video”) resolution (typically having aresolution of 720×586 pixels or 720×480 pixels) or Standard Definitionor “SD” resolution (where the video content only has a resolution of640×480 pixels). Some broadcast channels are limited to SD resolutions.Video-streaming services can be restricted to operating at DVD-Video orSD resolutions, to reduce transmission problems where consumers havelimitations on available transmission bandwidth or because of a lack oflegacy content at higher resolutions.

As a result, there can be a lack of sufficiently high-resolution videocontent for display on HD and Ultra HD television screens, for bothcurrent video content as well as for legacy video content and videostreaming services. Also, over time mobile devices such as mobile‘phones and tablet computers with increasingly larger andhigher-resolution screens are being produced and adopted by users.Further, current video content, being output at HD resolutions, isalready at a significantly lower resolution than can be displayed by thelatest consumer displays operating at, for example, Ultra HDresolutions. To provide sufficiently immersive virtual reality (or “VR”)experiences, display technology needs to be sufficiently high resolutioneven for smaller screen sizes.

The user experience of having to display content that has significantlylower resolution than the user's default screen/display resolution isnot optimal.

Growth in Data Transmission and Network Limitations

The amount of visual data being communicated over data networks such asthe Internet has grown dramatically over time and there is increasingconsumer demand for high-resolution, high quality, high fidelity visualdata content, such as video streaming including, for example, video atHD and Ultra HD resolution. As a result, there are substantialchallenges in meeting this growing consumer demand and high performancevideo compression is required to enable efficient use of existingnetwork infrastructure and capacity.

Video data already makes up a significant fraction of all data trafficcommunicated over the Internet, and mobile video (i.e. video transmittedto and from mobile devices over wireless data networks such asUTMS/CDMA) is predicted to increase 13-fold between 2014 and 2019,accounting for 72 percent of total mobile data traffic by the end ofthat forecast period. As a result, there are substantial challenges inmeeting this growing consumer demand and more efficient visual datatransmission is required to enable efficient use of existing networkinfrastructure and capacity.

To stream video to consumers using available streaming data bandwidth,media content providers can down-sample or transcode the video contentfor transmission over a network at one or a variety of bitrates so thatthe resolution of the video can be appropriate for the bitrate availableover each connection or to each device and correspondingly the amount ofdata transferred over the network can be better matched to the availablereliable data rates. For example, a significant proportion of currentconsumer Internet connections are not able to reliably supportcontinuous streaming of video at an Ultra HD resolution, so video needsto be streamed at a lower quality or lower resolution to avoid bufferingdelays.

Further, where a consumer wishes to broadcast or transmit video content,the uplink speeds of consumer Internet connections are typically afraction of the download speeds and thus only lower quality or lowerresolution video can typically be transmitted. In addition, the datatransfer speeds of typical consumer wireless networks are anotherpotential bottleneck when streaming video data for video at resolutionshigher than HD resolutions or virtual reality data and content to/fromcontemporary virtual reality devices. A problem with reducing theresolution of a video when transmitting it over a network is that thereduced resolution video may not be at the desired playback resolution,but in some cases there is either not sufficient bandwidth or thebandwidth available is not reliable during peak times for transmissionof a video at a high resolution.

Alternatively, even without reducing the original video resolution, theoriginal video may have a lower resolution than desired for playback andso may appear at a suboptimal quality when displayed onhigher-resolution screens.

Video Compression Techniques

Existing commonly used video compression techniques, such as H.264 andVP8, as well as proposed techniques, such as H.265, HEVC and VP9, allgenerally use similar approaches and families of compression techniques.These compression techniques make a trade-off between the quality andthe bit-rate of video data streams when providing inter-frame andintra-frame compression, but the amount of compression possible islargely dependent on the image resolution of each frame and thecomplexity of the image sequences.

To illustrate the relationship between bitrate and resolution amongother factors, it is possible to use an empirically-derived formula toshow how the bitrate of a video encoded with, for example the H.264compression technique, relates to the resolution of that video:

bitrate∝Q×w×h×f×m

where Q is the quality constant, w is the width of a video, h is theheight of a video, f is the frame-rate of a video and m is the motionrank, where mϵ{1, . . . , 4} and a higher m is used for fast-changinghard-to-predict content.

The above formula illustrates the direct relationship between thebitrate and the quality constant Q. A typical value, for example, thatcould be selected for Q would be 0.07 based on published empirical data,but a significant amount of research is directed to optimising a valuefor Q.

The above formula also illustrates the direct relationship between thebitrate and the complexity of the image sequences, i.e. variable m. Theaforementioned existing video codecs focus on spatial and temporalcompression techniques. The newer proposed video compression techniques,such as H.265, HEVC and VP9, seek to improve upon the motion predictionand intra-frame compression of previous techniques, i.e. optimising avalue form.

The above formula further illustrates a direct relationship between thebitrate and the resolution of the video, i.e. variables w and h. Inorder to reduce the resolution of video, several techniques exist todownscale the resolution of video data to reduce the bitrate.

As a result of the disadvantages of current compression approaches,existing network infrastructure and video streaming mechanisms arebecoming increasingly inadequate to deliver large volumes of highquality video content to meet ever-growing consumer demands for thistype of content. This can be of particular relevance in certaincircumstances, for example in relation to live broadcasts, wherebandwidth is often limited, and extensive processing and videocompression cannot take place at the location of the live broadcastwithout a significant delay due to inadequate computing resources beingavailable at the location.

Video Upscaling Techniques

To reproduce a video at a higher resolution than that at which it hasbeen transmitted (e.g. by a streaming service or broadcaster) orprovided (e.g. on DVD or via a video download provider), various“upscaling” techniques exist to increase the resolution of videodata/signals, which enhance image quality when starting from a lowerresolution image or video and which produce an image or video of ahigher resolution.

Referring to FIG. 14, a conventional upscaling technique 1400 will nowbe described.

Received video data 1410 is provided into a decoder system and is, forexample, a lower-resolution video encoded in a standard video format,such as an SD resolution video. This video format can be a variety ofknown video codecs, for example such as H.264 or VP8, but can be anyvideo data that the system is able to decode into component frames ofvideo.

The system then separates a first section of the video data 1410 intosingle frames at step 1420, i.e. into a sequence of images at the fullSD resolution of the video data 1410. For some video codecs, this willinvolve “uncompressing” or restoring the video data as, for example,common video compression techniques remove redundant (non-changing)features from sequential frames.

An upscaling technique 1430 is then used on one or more of the frames orsections of frames, to increase the resolution of the areas upon whichit is used. The higher resolution frames are then optionally processedat step 1440 into a format suitable for output as a video. The video,being composed of higher resolution frames, will be in the form of ahigher resolution video 1450 than the original video file.

For example, a basic upscaling technique that makes little attempt toenhance the quality of the video is known as nearest-neighbourinterpolation. This technique simply increases the resolution ofreceived video data by representing an original pixel of the transmittedvideo as multiple pixels or a “block” of pixels. The resulting effect isthat the video appears pixelated and in blocks.

Other less basic upscaling techniques use the existing video data toestimate unknown intermediate pixels between known pixel values in orderto increase the resolution with a less noticeable loss in quality, thesetechniques generally known by the term interpolation, these techniquestypically factoring into account a weighted average of known pixels inthe vicinity of each unknown intermediate pixel or fit to a curve orline to surrounding values and interpolate to the mid-point along thecurve or line (e.g. bicubic or bilinear interpolation). Typically, suchupscaling techniques determine values for the additional pixels requiredto create a higher resolution image by averaging neighbouring pixels,which creates a blurring effect or other visual artefacts such as“ringing” artefacts. Most upscaling techniques use interpolation-basedtechniques to produce higher-resolution versions of received video data.Various methods of interpolation are possible and well documented in theprior art in relation to video or image enhancement.

Various methods of interpolation are possible and well documented in theprior art in relation to video or image enhancement. There are manyproblems with conventional upscaling techniques. Upscaling techniquesthat reduce jagged edges tend to introduce more blur to an up-scaledvideo, for example, while upscaling techniques that reduce “halos” or“ringing” artefacts tend to make an up-scaled video less sharp. Further,conventional upscaling techniques are not content-aware or adaptive.Fundamentally, conventional upscaling techniques are limited by theNyquist-Shannon sampling theorem.

As a result of the disadvantages of current upscaling techniques, thequality of video data that has been “up-scaled” to a higher resolutionthan that at which it is stored or transmitted can be inadequate ornon-optimal for its intended function.

Super Resolution Techniques for Enhancing Images

Super resolution techniques are techniques that can be described asrecovering new high-resolution information that is not explicitlypresent in low-resolution images.

Super resolution techniques have been developed for many differentapplications, such as for satellite and for aerial imaging and medicalimage analysis for example. These applications start with low-resolutionimages where the higher-resolution image is not available or is possiblyunknowable, and by using super resolution techniques it is possible tomake substantial enhancements to the resolution of such low-resolutionimages.

Super resolution techniques allow for the creation of one or morehigh-resolution images, typically from one or more low-resolutionimages. Typically, super resolution is applied to a set or series oflow-resolution images of the same scene and the technique attempts toreconstruct a higher-resolution image of the same scene from theseimages.

Super resolution techniques fall predominantly into one of two mainfields; optical super resolution techniques and geometrical superresolution techniques. Optical super resolution techniques allow animage to exceed the diffraction limit originally placed on it, whilegeometrical super resolution techniques increase the resolution fromdigital imaging sensors. In the field of image resolution enhancement,geometrical super resolution seems to be the predominant technique.Further, super resolution approaches are usually split into learning- orexample-based approaches and interpolation-based (multi-frame)approaches. Example based super resolution techniques are generallyaccepted to be a superior technique to enhance image quality.

One specific super resolution technique is termed multi-exposure imagenoise reduction. This technique takes the average of many exposures inorder to remove unwanted noise from an image and increase theresolution.

Another super resolution technique employed is sub-pixel imagelocalisation, which involves calculating the ‘centre of gravity’ of thedistribution of light over several adjacent pixels and correctingblurring accordingly. However, this technique relies on the assumptionthat all light in the image came from the same source, which is notalways a correct assumption.

Machine Learning Techniques

Machine learning is the field of study where a computer or computerslearn to perform classes of tasks using the feedback generated from theexperience or data gathered that the machine learning process acquiresduring computer performance of those tasks.

Typically, machine learning can be broadly classed as supervised andunsupervised approaches, although there are particular approaches suchas reinforcement learning and semi-supervised learning which havespecial rules, techniques and/or approaches.

Supervised machine learning is concerned with a computer learning one ormore rules or functions to map between example inputs and desiredoutputs as predetermined by an operator or programmer, usually where adata set containing the inputs is labelled.

Unsupervised learning is concerned with determining a structure forinput data, for example when performing pattern recognition, andtypically uses unlabelled data sets.

Reinforcement learning is concerned with enabling a computer orcomputers to interact with a dynamic environment, for example whenplaying a game or driving a vehicle.

Various hybrids of these categories are possible, such as“semi-supervised” machine learning where a training data set has onlybeen partially labelled.

For unsupervised machine learning, there is a range of possibleapplications such as, for example, the application of computer visiontechniques to image processing or video enhancement. Unsupervisedmachine learning is typically applied to solve problems where an unknowndata structure might be present in the data. As the data is unlabelled,the machine learning process is required to operate to identify implicitrelationships between the data for example by deriving a clusteringmetric based on internally derived information. For example, anunsupervised learning technique can be used to reduce the dimensionalityof a data set and attempt to identify and model relationships betweenclusters in the data set, and can for example generate measures ofcluster membership or identify hubs or nodes in or between clusters (forexample using a technique referred to as weighted correlation networkanalysis, which can be applied to high-dimensional data sets, or usingk-means clustering to cluster data by a measure of the Euclideandistance between each datum).

Semi-supervised learning is typically applied to solve problems wherethere is a partially labelled data set, for example where only a subsetof the data is labelled. Semi-supervised machine learning makes use ofexternally provided labels and objective functions as well as anyimplicit data relationships.

When initially configuring a machine learning system, particularly whenusing a supervised machine learning approach, the machine learningalgorithm can be provided with some training data or a set of trainingexamples, in which each example is typically a pair of an inputsignal/vector and a desired output value, label (or classification) orsignal. The machine learning algorithm analyses the training data andproduces a generalised function that can be used with unseen data setsto produce desired output values or signals for the unseen inputvectors/signals. The user needs to decide what type of data is to beused as the training data, and to prepare a representative real-worldset of data. The user must however take care to ensure that the trainingdata contains enough information to accurately predict desired outputvalues without providing too many features (which can result in too manydimensions being considered by the machine learning process duringtraining, and could also mean that the machine learning process does notconverge to good solutions for all or specific examples). The user mustalso determine the desired structure of the learned or generalisedfunction, for example whether to use support vector machines or decisiontrees.

The use of unsupervised or semi-supervised machine learning approachesare sometimes used when labelled data is not readily available, or wherethe system generates new labelled data from unknown data given someinitial seed labels.

Current training approaches for most machine learning algorithms cantake significant periods of time, which delays the utility of machinelearning approaches and also prevents the use of machine learningtechniques in a wider field of potential application.

Machine Learning & Image Super Resolution

To improve the effectiveness of some super resolution techniques, it ispossible to incorporate machine learning, otherwise termed a “learnedapproach”, into the image super resolution techniques described above.

For example, one machine learning approach that can be used for imageenhancement, using dictionary representations for images, is a techniquegenerally referred to as dictionary learning. This approach has showneffectiveness in low-level vision tasks like image restoration.

When using dictionary learning, the representation of a signal is givenas a linear combination of functions drawn from a collection of atomsreferred to as a dictionary. For example, a given signal y can berepresented as:

y=α ₁ x ₁+α₂ x ₂+ . . . +α_(n) x _(n)

where x₁, . . . , x_(n) are the atoms of a dictionary of size n and α₁,. . . α_(n) are coefficients such that ∥α∥₀<λ, where λ is the sparsityconstraint, for example where λ=3 no more than three coefficients can benon-zero. The atoms have the same dimensionality as the signal y so,while it is possible to have an atom x_(i) that is identical to y, adictionary of simple atoms can usually be used to reconstruct a widerange of different signals.

In theory, at least k orthogonal atoms are required to fully reconstructsignals in k-dimensional space. In practice, however, improved resultsare achieved through using an over-complete dictionary where there aren>k atoms and these atoms do not have to be orthogonal to one another.

A complete dictionary means that the number of dictionary atoms is thesame as the dimensionality of the image patches and that the dictionaryatoms are linearly independent (i.e. all orthogonal to each other andcan represent the entire, or complete, dimensional space), so where16×16 atoms represent 16×16 image patches, the dictionary is complete ifit has 16×16=256 atoms. If more atoms than this are present in thedictionary, then the dictionary becomes over-complete.

An example of an over-complete dictionary is shown in FIG. 1, where a16×16 pixel patch is represented by a linear combination of 16×16dictionary atoms 5 that is drawn from the collection of atoms that isthe dictionary 1. It is noted that the atoms are not selected locallywithin the dictionary, but instead are chosen as the linear combinationthat best approximates the signal patch for a maximum number of atomsallowed and irrespective of their location within the dictionary.Without a constraint that the atoms must be orthogonal to one another,larger dictionaries than the signal space that the dictionary isintended to represent are created.

Over-complete dictionaries are used because they provide betterreconstructions, but at the cost of needing to store and transmit all ofthe new dictionaries and representations created during the dictionarylearning process. In comparison with a predetermined library ofrepresentations, a significantly increased amount of data is created asa result of dictionary learning because it generates a data setsignificantly larger than the basis set in a predetermined library ofrepresentations and the atoms are not all orthogonal to one another.

In dictionary learning, where sufficient representations are notavailable in an existing library of representations (or there is nolibrary available), machine learning techniques are employed to tailordictionary atoms such that they can adapt to the image features andobtain more accurate representations. Each new representation is thentransferred along with the video data to enable the representation to beused when recreating the video for viewing.

The transform domain can be a dictionary of image atoms, which can belearnt through a training process known as dictionary learning thattries to discover the correspondence between low-resolution andhigh-resolution sections of images (or “patches”). Dictionary learninguses a set of linear representations to represent an image and, where anover-complete dictionary is used, a plurality of linear representationscan be used to represent each image patch to increase the accuracy ofthe representation.

When using dictionary learning based super resolution techniques, thereis a need for two dictionaries: one for the low-resolution image and aseparate dictionary for the high-resolution image. To combine superresolution techniques with dictionary learning, reconstruction modelsare created to enhance the image based on mapping the coefficients ofthe low-resolution dictionary to coefficients in the high-resolutiondictionary. Various papers describe this, including “On Single ImageScale-Up Using Sparse-Representations” by R. Zeyde et al and publishedin 2010, “Image super-resolution via sparse representation” by J. Yangand published in 2010, and “Coupled Dictionary Training for ImageSuper-Resolution” by J. Yang et al and published in 2012, which areincorporated by reference.

A disadvantage of using dictionary learning based super resolutiontechniques on low-resolution images to attempt to recreate thehigh-resolution image is the need for two dictionaries, one for thelow-resolution image and a separate dictionary for the high-resolutionimage. It is possible to have a single combined dictionary, but inessence there is always in practice an explicit modelling for eachresolution to enable representations to be matched between the tworesolutions of image.

A further disadvantage of using dictionary learning, however, especiallywhen used with an over-complete dictionary, is the amount of data thatneeds to be transferred along with the low-resolution image in order torecreate a high-resolution image from the low-resolution image.

Another disadvantage of dictionary learning approaches is that thesetend to use a local patch averaging approach in the final step ofreconstruction of a higher-resolution image from a lower-resolutionimage, which can result in unintentional smoothing in the reconstructedimage.

Another further disadvantage of dictionary learning approaches is thatit is very slow and can have high memory requirements, depending on thesize of the dictionary.

Artefact Removal in Visual Data

Visual data artefacts and/or noise can often be introduced into visualdata during processing, particularly during processing to compressvisual data or during transmission of the visual data across a network.Such introduced artefacts can include blurring, pixelation, blocking,ringing, aliasing, missing data, and other marks, blemishes, defects,and abnormalities in the visual data. These artefacts in visual data candegrade the user experience when viewing the visual data. Furthermore,these artefacts in visual data can also reduce the effectiveness ofvisual data processing techniques, such as image super resolution, aswell as other visual tasks such as image classification andsegmentation, that use processed images as an input.

Lossy compression, in which a visual data is encoded using inexactapproximations, is a particularly common source of artefacts. Lossycompression is often required to reduce the size of a digital image orvideo in order to transmit it across a network without using anexcessive amount of bandwidth. High visual data compression ratios canbe achieved using lossy compression, but at the cost of a reduction inquality of the original visual data and the introduction of artefacts.

The transmission of visual data across a network can itself introduceartefacts to the visual data through transmission errors between nodesin the network.

Current methods of removing artefacts (herein referred to as visual datafidelity correction) generally only correct a specific types ofartefact. Examples of such techniques include deblocking orientedmethods, such as Pointwise Shape-Adaptive Discrete Cosine Transform(hereafter referred to as Pointwise SA-DCT), which deal with blockingartefacts. Such techniques do not perform well, and can also introducefurther artefacts as a side effect, such as the over smoothing of visualdata.

SUMMARY

Aspects and/or embodiments are set out in the appended claims. These andother aspects and embodiments are also described herein.

Certain aspects and/or embodiments seek to provide techniques forgenerating hierarchical algorithms that can be used, when convertingoriginal high-quality visual data into lower-quality visual data, toallow recreation of higher-quality visual data from the lower-qualityvisual data without significant loss in quality between the originalhigh-quality visual data and the higher quality visual data.

Further aspects and/or embodiments seek to provide techniques forreconstruction and/or enhancement from lower-quality visual data tohigher-quality visual data.

Other aspects and/or embodiments seek to provide techniques for machinelearning.

General Training Method

According to an aspect, there is provided a method for developing anenhancement model for low-quality visual data, the method comprising thesteps of: receiving one or more sections of higher-quality visual data;training a hierarchical algorithm, wherein the hierarchical algorithm isoperable to increase the quality of one or more sections oflower-quality visual data to substantially reproduce the one or moresections of higher-quality visual data; and outputting the hierarchicalalgorithm.

Training hierarchical algorithms can allow enhancement and/orreconstruction models to be developed for enhancing visual data in atleast one embodiment. In some embodiments visual data can be image dataand/or video data. Furthermore, in some embodiments enhancement modelscan be developed to increase the accuracy of higher-quality visual datathat can be reproduced from lower-quality visual data in comparison tooriginal higher-quality visual data. In at least one embodiment,knowledge of the original visual data can allow the hierarchicalalgorithm to be trained (and/or developed) based on knowledge of boththe original visual data and the low-quality visual data in order totrain a hierarchical algorithm to substantially reproduce the originalvisual data from the low-quality visual data.

Optionally, the hierarchical algorithm is developed from a knowninitialisation.

In some embodiments, the hierarchical algorithm can be developed from aknown initialisation, for example of a hierarchical function or basis.In some of these embodiments, the hierarchical function or basis can befor example haar wavelets or one or more pre-trained hierarchicalalgorithms or sets of hierarchical algorithms. In at least oneembodiment, providing a known initialisation allows the training ofhierarchical algorithms to be accelerated, and the known initialisationcan be closer to the best solution especially when compared to startingfrom a random initialisation. In some embodiments, a trainedhierarchical algorithm can be developed for input visual data, whereinthe trained hierarchical algorithm is developed for that input databased on the selected most similar pre-trained algorithm. In at leastone embodiment, the selection of the one or more most similarpre-trained algorithm(s) can be made based on one or more metricsassociated with the pre-trained models when compared and/or applied tothe input data. In some embodiments, metrics can be any predeterminedmeasure of similarity or difference. In some embodiments, the mostsimilar pre-trained algorithm can be used as a starting point fordeveloping a trained or tailored algorithm for the input data as atailored algorithm does not have to undergo as extensive development asneeded when developing an algorithm from first principles.

Optionally, the method is performed at a first network node within anetwork. Furthermore, optionally the hierarchical algorithm may betransmitted to a second network node in the network.

By lowering the quality of visual data (for example by lowering theresolution of video data) in some embodiments, less data can be sentacross a network from a first node to a second node in order for thesecond node to display the visual data from the first node. In someembodiments, the lower quality visual data together with a model to beused for reconstruction can allow for less data to be transmitted thanif the original higher-quality version of the same visual data istransmitted between nodes.

Optionally, the one or more sections of lower-quality visual data aregenerated from the one or more sections of higher-quality visual data.Furthermore, optionally the one or more sections of lower-quality visualdata may be generated from the high-quality visual data using a processcomprising down-sampling.

By lowering the quality of a section of visual data in some embodiments,less data can be sent in order to transmit the visual data over anetwork. Further, in some embodiments, sending both the lower qualityversion together with a model to be used for reconstruction can stillresult in less data being transmitted than if the originalhigher-quality version of the same section of visual data is transmittedalone.

Optionally, the one or more sections of lower-quality visual data aregenerated from the one or more sections of higher-quality visual datausing a process comprising compression and/or quantisation.

Lossy compression, a reduction in frame rate, a reduction in pixel dataprecision (e.g. from 32-bit to 16-bit) and quantisation of visual dataare methods for producing lower-quality visual data from higher-qualityvisual data and can be used in some embodiments to generatelower-quality visual data from higher-quality visual data.

Optionally, the one or more sections of higher-quality visual dataand/or lower quality visual data comprise any of: a single frame, asequence of frames and a region within a frame or sequence of frames.Optionally, the one or more sections of higher-quality visual dataand/or the one or more sections of lower-quality visual data maycomprise an image, a sequence of images, a section of video or an outputof a video game.

Depending on the visual data being processed in an embodiment, modelscan be generated for sections of visual data comprising a single frame,a sequence of frames or a region within a frame or sequence of frames.Each of these options can be used in some or all embodiments in order toprovide a method of enhancing or reconstructing visual data to producehigher quality visual data.

General Enhancement/Reconstruction

According to another aspect, there is provided a method for enhancinglower-quality visual data using hierarchical algorithms, the methodcomprising the steps of: receiving one or more sections of lower-qualityvisual data; applying a hierarchical algorithm to the one or moresections of lower-quality visual data to enhance the one or moresections of lower-quality visual data to one or more sections ofhigher-quality visual data, wherein the hierarchical algorithm wasdeveloped using a learned approach; and outputting the one or moresections of higher-quality visual data.

In some embodiments, a section of visual data that has been transmittedacross a network can be enhanced using hierarchical algorithms. Byapplying a hierarchical algorithm in some or all of these embodiments, ahigher-quality version of the visual data can be output for inputlower-quality visual data. Therefore, in some embodiments, onlylower-quality visual data need to be transmitted over the network. Inother embodiments, lower-quality visual data can be transmitted over thenetwork along with one or more hierarchical algorithms that can be usedto enhance lower-quality visual data.

Optionally, the hierarchical algorithm is selected from a library oflearned hierarchical algorithms.

In some embodiments, a stored library of learned hierarchical algorithmsallows selection of a hierarchical algorithm for comparison withouthaving to develop them or obtain them from an external source. In someembodiments, the comparison can be between a plurality of algorithms inthe library. Use of such a library, in at least some embodiments, mayresult in the faster selection of a suitable hierarchical algorithm forenhancing the visual data or, in some embodiments, the most suitablehierarchical algorithm in a library (for example, by basing a measure ofsuitability on a predetermined metric).

Optionally, the selection of the hierarchical algorithm from the libraryof learned hierarchical algorithms is determined by metric dataassociated with the lower-quality visual data.

In some embodiments, it is assumed that the closer the features of thehierarchical algorithm are to those of metric data associated with thelower-quality visual data, the more accurate a reconstruction can becreated using that particular hierarchical algorithm. Therefore, byusing associated metric data in some embodiments in this way, anappropriate model may be more accurately chosen from the plurality ofhierarchical algorithms available.

Optionally, the steps of receiving the one or more sections oflower-quality visual data and applying the hierarchical algorithm to theone or more sections of lower quality visual data occur substantiallysimultaneously.

In some embodiments, by receiving the one or more sections oflower-quality visual data and substantially simultaneously applying thehierarchical algorithm to one or more sections of lower-quality visualdata, the time taken to enhance the visual data can be reduced. This isespecially beneficial for live broadcasting embodiments, where it can beadvantageous for the time taken for visual data processing beforetransmission to be minimised.

Optionally, the one or more sections of lower-quality visual data aregenerated from one or more sections of original higher-quality visualdata.

In some embodiments, by generating lower-quality visual data fromoriginal higher-quality visual data and transmitting the lower-qualityvisual data instead of the original higher-quality visual data, lessdata needs to be processed or sent across a network.

Offline Training

According to another aspect, there is provided a method for developingan enhancement model for visual data, the method comprising the stepsof: receiving one or more sections of higher-quality visual data and oneor more sections of lower-quality visual data corresponding to the oneor more sections of higher-quality data; developing a hierarchicalalgorithm, wherein the hierarchical algorithm is operable tosubstantially reproduce the one or more sections of higher-qualityvisual data from the corresponding one or more sections of lower-qualityvisual data; and storing the developed hierarchical algorithm in alibrary of developed hierarchical algorithms.

In some embodiments, by developing and storing hierarchical algorithmstrained to enhance visual data in a library of enhancement algorithms,trained hierarchical algorithms can be selected from the library forrepeated use to reduce the need for individual training from scratchevery time enhancement of visual data is required. In some of theseembodiments, this approach can save computational expense and speed upthe transmission of visual data across a network, for example where itis possible to choose a suitable model for visual enhancement from thelibrary rather than train a new one. It also allows for hierarchicalalgorithms to be trained in advance of the transmission of visual data,for at least some embodiments, removing time constraints that can bepresent when training hierarchical algorithms substantially immediatelybefore visual data is transmitted.

Optionally, the developed hierarchical algorithm is stored associatedwith metric data relating to a content type of the higher-quality visualdata and/or lower-quality visual data from which the hierarchicalalgorithm was developed.

In some embodiments, by storing the trained model in the library withmetric data relating to the associated visual data, optionally where themetric data can be used to determine whether the trained model would besuitable for use with visual data having similar metric data, suchmetric data can be used to compare to metric data associated withfurther visual data to select a suitable hierarchical algorithm toenhance that further visual data. This means that, in at least some ofthese embodiments, a specific hierarchical algorithm need not be trainedfor every set of visual data; existing trained hierarchical algorithmscan instead be used to enhance similar sets of visual data to that onwhich they were trained.

Optionally, the hierarchical algorithm is developed from a knownhierarchical algorithm.

In some embodiments, developing a new hierarchical algorithm from aknown hierarchical algorithm that was trained on similar visual data tothe visual data on which the new algorithm is to be trained can reducethe time and/or computational effort required to train the newhierarchical algorithm.

Optionally, the known hierarchical algorithm is stored in the library ofdeveloped hierarchical algorithms.

For some embodiments, having one or more known algorithms stored in alibrary of previously developed algorithms can allow for thesealgorithms to be accessed quickly and easily, increasing the efficiencyof the training process.

Optionally, the method is performed at a network node within a network.

By performing the method at a network node in some embodiments, theresulting trained hierarchical algorithms can be transmitted across thenetwork to further network nodes at which they are required. It alsoallows, in at least some embodiments, for the library of trained modelsto be stored remotely from the location at which the training takesplace.

Optionally, the method additionally comprises a step of encoding the oneor more sections of higher quality visual data and/or the one or moresections of lower-quality visual data.

Optionally, the step of encoding the one or more sections of higherquality visual data and/or the one or more sections of lower-qualityvisual data occurs after the step of developing the hierarchicalalgorithm.

Visual data is often encoded prior to transmission across a network, orstorage in a memory, in embodiments. By encoding the visual data afterthe hierarchical algorithm has been trained in at least someembodiments, the visual data is then ready for transmission or storage.The trained hierarchical algorithm will then be operable to enhance thequality of decoded visual data in these embodiments.

Optionally, the method additionally comprises a step of refining thehierarchical algorithm after the step of encoding the one or moresections of higher quality visual data and/or the one or more sectionsof lower-quality visual data.

By refining the hierarchical algorithm after the encoding of the visualdata in some embodiments, the hierarchical algorithm can be trained toenhance the quality of the encoded visual data without the visual datahaving to be decoded first. In some of these embodiments, this candecrease the time required to decode and enhance the lower-qualityvisual data to substantially reproduce the higher-quality visual data.

According to a further aspect, there is provided a method for reducingthe amount of data to be transferred when communicating visual data overa network from a first node to a second node, the method at the firstnode comprising the steps of: reducing the quality of one or moresections of higher-quality visual data to one or more sections oflower-quality visual data; selecting at least one algorithm operable toincrease the quality of at least one section of lower-quality visualdata using the higher-quality visual data to optimise the selection ofthe algorithm, wherein the algorithm corresponds to at least the onesection of lower quality visual data; transmitting the one or moresections of lower-quality visual data to the second node; andtransmitting to the second node one or more references corresponding tothe one or more selected algorithms that correspond to the one or moresections of lower-quality visual data transmitted to the second node;wherein the second node is able to identify the selected algorithm usingthe transmitted one or more references and substantially reproduce thehigher-quality visual data from the transmitted lower-quality visualdata using the identified selected algorithms that corresponds to eachsection of lower-quality visual data.

According to another aspect, there is provided a method for increasingthe quality of a section of visual data communicated over a network froma first node to a second node, the method at the second node comprisingthe steps of: receiving a lower-quality visual data via a network;receiving a corresponding reference to an algorithm operable to increasethe quality of the lower-quality visual data, the algorithm selectedwith the knowledge of a higher-quality visual data from which thelower-quality visual data was generated; and using the algorithm toincrease the quality of the lower-quality visual data to substantiallyrecreate the higher-quality visual data.

According to a further aspect, there is provided a system for reducingthe amount of data transferred when communicating visual data over anetwork, the system comprising two or more nodes wherein a first node isconfigured to: reduce the quality of one or more sections ofhigher-quality visual data to one or more sections of lower-qualityvisual data; select at least one algorithm operable to increase thequality of at least one section of lower-quality visual data using thehigher-quality visual data to optimise the selection of the algorithm,wherein the algorithm corresponds to at least the one section of lowerquality visual data; transmit the one or more sections of lower-qualityvisual data to the second node; and transmit to the second node one ormore references to the one or more algorithms that correspond to the oneor more sections of lower-quality visual data transmitted to the secondnode; wherein the second node is configured to: receive a lower-qualityvisual data via a network; receive a corresponding reference to thealgorithm operable to increase the quality of the lower-quality visualdata, the algorithm selected with the knowledge of a higher-qualityvisual data from which the lower-quality visual data was generated; anduse the algorithm to increase the quality of the lower-quality visualdata to substantially recreate the higher-quality visual data.

By transmitting a lower-quality version of a visual data in someembodiments, such as a section of low-quality visual data or series ofvisual data sections, together with a library reference to an algorithm(i.e. any or all of an algorithm, reconstruction algorithm, model,reconstruction model, parameters or reconstruction parameters) to aidreconstruction of higher quality visual data, such as a high-resolutionvideo frame or series of frames, in at least some embodiments less datacan be transferred over a network to enable high-quality visual data tobe viewed compared to transmitting the high quality visual data alone.

Optionally, the steps of transmitting the one or more sections oflower-quality visual data to the second node and transmitting to thesecond node one or more references corresponding to the one or moreselected algorithms that correspond to the one or more sections oflower-quality visual data transmitted to the second node occur together,or substantially simultaneously.

By transmitting both visual data and one or more references toalgorithms in a library of algorithms, a reduced amount of data can betransmitted as only one or more references to algorithms are transmittedinstead of the algorithms themselves.

Optionally, the algorithm is a hierarchical algorithm.

In some embodiments, the algorithms used are hierarchical algorithms. Itshould be noted that algorithms could also be referred to as models,representations, parameters or functions. In some of these embodiments,hierarchical algorithms can enable substantially accurate reconstructionof visual data, e.g. produce a higher quality high-resolution video fromthe low-resolution video that is transmitted, for example where qualitycan be measured by a low error rate in comparison to the originalhigh-resolution video.

Optionally, the algorithm is a non-linear algorithm.

In some embodiments, the use of non-linear algorithms can be moreflexible and expressive than dictionary learning based approaches, anduse fewer coefficients for the reconstruction of higher-quality visualdata. In some of these embodiments, this can allow the reconstruction ofthe sections of higher-quality to be substantially accurate.

Optionally, the algorithm is selected from a library of algorithmsstored at any of: the first node; the second node; a centraliseddatabase in the network; or a distributed database in the network.

In some embodiments, a library of algorithms can allow for the selectionof an substantially optimal, if not the most optimal, algorithmavailable in the library to reconstruct the lower-quality visual datainto higher quality visual data. In some of these embodiments, the useof a library can also allow the selected algorithm to be referred to bya reference identifier. In certain embodiments, libraries can beprovided at both nodes, and/or in centralised or distributed databases,and optionally can use common or synchronised reference identifiers forthe same algorithms.

Optionally, the received reference corresponds to an algorithm stored ina library at the second node.

By providing common or synchronised libraries of algorithms at both thefirst and the second nodes in at least some embodiments, and bytransmitting a reference or reference identifier when transmitting thecorresponding lower-quality visual data to allow selection of matchingalgorithms from both libraries using the reference identifier toidentify the selected algorithm, only the reference identifier and thelower-quality visual data needs to be transmitted between the nodes thusdata transmission is reduced as the algorithm itself doesn't need to betransmitted.

Optionally, if the second node cannot identify the selected algorithm,the second node sends a request to any of: the first node; a centraliseddatabase; or a distributed database for transmission of the selectedalgorithm to the second node.

In some embodiments, by configuring the second node to be able torequest models from a node (for example a first node or alternativelyanother node or a node to which multiple libraries are synchronised,depending on embodiment) in situations where the libraries at the secondnode and other node are not synchronised, the higher-quality visual datacan still be reconstructed even if the transmitted reference does notcorrespond to an algorithm stored at the second node. This can preventerrors in the reconstruction process in some embodiments.

Optionally, the algorithm comprises one or more convolutional neuralnetworks.

In some embodiments, convolutional neural networks can achievesubstantially optimal reconstruction of higher-quality visual data fromlower-quality visual data (when the reconstructed higher-quality visualdata is compared to the original high-quality visual data) while beingrelatively small in data size, for example when compared toover-complete dictionaries.

Optionally, the high-quality visual data is divided into smallersections based on similarities between a plurality of sections of thehigh-quality visual data.

In some embodiments, by dividing the visual data into smaller sections,where the sections can be sequences of frames or portions of one or moreframes, and where the division can be based on a particular metric forsimilarity, more efficient models can be selected. For example, in someembodiments multiple sections can be grouped, all of which comprise partof a landscape shot, and one model can be used to reconstruct the scene,i.e. sequence of frames, as opposed to a using a different model forevery separate frame in the scene. In some embodiments, if the nextscene in the visual data is very different (for example a scene withsignificant movement after a scene showing a still landscape), then thescene can be detected as being very different and a new model can beselected accordingly for the scene. In some embodiments, specific modelscan be selected for each scene or section, allowing at least someoptimisation or adapting of the reconstruction model(s) in comparison tothe use of a generic model for the whole of the visual data.

Optionally the one or more sections comprises any of: a single frame, asequence of frames and a region within a frame or sequence of frames.

Depending on the visual data being processed, in some embodiments modelscan be selected for sections of visual data comprising a single frame, asequence of frames or a region within a frame or sequence of frames.This selection can be necessary in some of these embodiments in order toprovide the most efficient method of reconstructing a higher qualityversion of a part of the original visual data.

Optionally, the visual data is converted into a sequence of sections,optionally before the quality is lowered.

Separating the visual data into a sections, for example into a series offrames or images in some embodiments, allows for the individual sectionsto be down-sampled, thus reducing the size of visual data, and therebycan allow for lower quality sections to be transmitted as re-encodedvisual data in the original code (or optionally re-encoded using a moreoptimal codec and/or at a lower quality in some embodiments).

Optionally, down-sampling is used to reduce the quality of one or moresections of higher-quality visual data to one or more sections oflower-quality visual data.

By lowering the quality of the section of visual data in someembodiments, less data needs to be sent across a network from a firstnode to a second node in order for the second node to receive the file.In these embodiments the lower quality version together with a referenceto the model to be used for reconstruction can still allow for less datato be transmitted than if the original higher-quality version of thesame section of visual data is transmitted.

Optionally, the steps of transmitting the one or more sections oflower-quality visual data to the second node and transmitting to thesecond node the references to the one or more algorithms that correspondto the one or more sections of lower-quality visual data transmitted tothe second node occur substantially simultaneously.

By transmitting the lower quality section of visual data and the modelreference simultaneously in some embodiments, the reconstruction processcan be initiated substantially instantaneously on arrival of the data,as opposed to there being a delay between the arrival of the section ofvisual data and the model reference or vice versa. In some embodiments,both the model and the section of visual data are necessary for ahigher-quality version of the section of visual data to be reconstructedsuch that the reconstructed visual data is of substantially the samequality as the original higher-quality visual data.

Online Training

According to an aspect, there is provided a method for enhancing visualdata when communicating visual data over a network from a first node toa second node, the method at the first node comprising the steps of:reducing the quality of one or more sections of higher-quality visualdata to one or more sections of lower-quality visual data; developing atleast one hierarchical algorithm operable to increase the quality of theone or more sections of lower quality visual data using the one or moresections of higher-quality visual data to enhance the developed at leastone hierarchical algorithm, wherein the developed at least onehierarchical algorithm corresponds to the one or more sections of lowerquality visual data; transmitting the one or more sections oflower-quality visual data to the second node; and communicating to thesecond node at least one of the developed at least one hierarchicalalgorithms that corresponds to the one or more sections of lower-qualityvisual data transmitted to the second node; wherein the second node isable to substantially reproduce the one or more sections ofhigher-quality visual data from the transmitted one or more sections oflower-quality visual data using the developed at least hierarchicalalgorithm that corresponds to the one or more sections of lower-qualityvisual data.

According to a further aspect, there is provided a method for enhancingvisual data when communicating visual data over a network from a firstnode to a second node, the method at the second node comprising thesteps of: receiving one or more sections of lower-quality visual datavia a network; receiving a corresponding at least one hierarchicalalgorithm operable to increase the quality of the one or more sectionsof lower-quality visual data, the at least one hierarchical algorithmdeveloped with the knowledge of one or more sections of higher-qualityvisual data corresponding to the one or more sections of lower-qualityvisual data; and using the at least one hierarchical algorithm toincrease the quality of the one or more sections of lower-quality visualdata to substantially recreate the one or more sections ofhigher-quality visual data.

According to another aspect, there is provided a system for reducing theamount of data transferred when communicating visual data over anetwork, the system comprising two or more nodes wherein a first node isconfigured to: reduce the quality of one or more sections ofhigher-quality visual data to one or more sections of lower-qualityvisual data; develop at least one hierarchical algorithm operable toincrease the quality of the one or more sections of lower quality visualdata using the one or more sections of higher-quality visual data toenhance the developed at least one hierarchical algorithm, wherein thedeveloped at least one hierarchical algorithm corresponds to the one ormore sections of lower quality visual data; transmitting the one or moresections of lower-quality visual data to the second node; andcommunicate to the second node at least one of the developed at leastone hierarchical algorithms that corresponds to the one or more sectionsof lower-quality visual data transmitted to the second node; wherein thesecond node is configured to: receive one or more sections oflower-quality visual data via a network; receive a corresponding atleast one hierarchical algorithm operable to increase the quality of theone or more sections of lower-quality visual data, the at least onehierarchical algorithm developed with the knowledge of one or moresections of higher-quality visual data corresponding to the one or moresections of lower-quality visual data; and use the at least onehierarchical algorithm to increase the quality of the one or moresections of lower-quality visual data to substantially recreate the oneor more sections of higher-quality visual data.

In some embodiments, by developing a hierarchical algorithm forenhancing the quality of a specific set of lower-quality visual data, amore accurate enhancement of that visual data can be achieved at areceiving node in a network. In some of these embodiments, havingknowledge of the higher-quality visual data to which the lower-qualityvisual data corresponds can lead to the training and/or development ofmore accurate hierarchical algorithms. In further of these embodiments,having knowledge of the compression settings of the lower-quality visualdata can also help in training and/or development of more accuratehierarchical algorithms and, in such embodiments, training hierarchicalalgorithms on visual data having the same compression settings canprovide substantially accurate hierarchical algorithms for thosecompression settings. Furthermore, in some embodiments, communicatingthe lower-quality algorithm across the network along with the associatedlower-quality visual data can reduce the amount of data required to betransmitted across the network when compared with the transmission ofthe higher-quality data alone. For some embodiments, this is especiallytrue in the case where the higher-quality visual data is at asignificantly higher quality than the lower-quality visual data.

Optionally, the developed at least one hierarchical algorithm isselected from a plurality of hierarchical algorithms developed inparallel at the first node.

Optionally, the at least one hierarchical algorithm is developed inparallel to the encoding of the lower-quality visual data.

In some embodiments, developing multiple hierarchical algorithms inparallel while encoding the visual data can speed up the process ofpreparing the visual data and hierarchical algorithm for communicationacross a network. In some of these embodiments, by developing multiplehierarchical algorithms in parallel, a greater number of possiblealgorithm structures can be explored and the most suitable chosen.

Optionally, the steps of transmitting the one or more sections oflower-quality visual data to the second node and communicating to thesecond node the developed at least one hierarchical algorithm thatcorresponds to the one or more sections of lower-quality visual datatransmitted to the second node occur substantially simultaneously.

By transmitting the visual data and communicating the associatedhierarchical algorithm substantially simultaneously in some embodiments,the reconstruction process at the second node can begin as soon as thehierarchical algorithm is received. This can reduce the delay, in someof these embodiments, between receiving lower-quality visual data andoutputting higher-quality visual data.

Optionally, the communicating to the second node of the at least one ofthe developed at least one hierarchical comprises transmitting thedeveloped at least one hierarchical algorithm to the second node.

In some embodiments, transmitting the whole of the developedhierarchical algorithm to the second node ensures that the developedhierarchical algorithm is available for use at the second node.

According to a further aspect, there is provided a method for reducingthe amount of data to be transferred when communicating visual data overa network from a first node to a second node, the method at the firstnode comprising the steps of: reducing the quality of a section ofhigher-quality visual data to a section of lower-quality visual data;analysing a first example based model for the use of reconstruction ofthe lower-quality section of visual data; analysing a further one ormore example based models for the use of reconstruction of thelower-quality section of visual data; selecting one or more examplebased models from a plurality of example based models to use based on aspecified metric; transmitting the section of lower-quality visual datato the second node; and transmitting to the second node the one or moreselected example based models that correspond to the lower-qualitysection of visual data transmitted to the second node; wherein thesecond node is able to substantially reproduce the higher-qualitysection of visual data from the transmitted lower-quality section ofvisual data using the one or more example based models that correspondsto the lower-quality section of visual data.

According to another aspect, there is provided a method for increasingthe quality of a lower-quality section of visual data communicated overa network from a first node to a second node, the method at the secondnode comprising the steps of: receiving a lower-quality section ofvisual data via a network; receiving a corresponding example based modeloperable to increase the quality of the lower-quality section of visualdata; and using the example based model to increase the quality of thelower-quality section of visual data to substantially recreate thehigher-quality section of visual data.

According to a further aspect, there is provided a system for reducingthe amount of data to be transferred when communicating visual data overa network, the system comprising two or more nodes wherein a first nodeis configured to: reduce the quality of a higher-quality section ofvisual data to a lower-quality section of visual data; analyse a firstexample based model for the use of reconstruction of the lower-qualitysection of visual data; analyse one or more example based models for theuse of reconstruction of the lower-quality section of visual data;select one or more example based models from a plurality of examplebased models to use based on a specified metric; transmit the section oflower-quality visual data to the second node; and transmit to the secondnode the one or more example based models that correspond to the sectionof lower-quality visual data transmitted to the second node; wherein thesecond node is configured to: receive a lower-quality section of visualdata via network; receive one or more corresponding example based modelsoperable to increase the quality of the lower-quality section of visualdata; and use the one or more example based models to increase thequality of the lower-quality section of visual data to substantiallyrecreate the higher-quality section of visual data.

According to an aspect, there is provided a method for increasing thequality of a lower-quality section of visual data, the method at thefirst node comprising the steps of: analysing a first example basedmodel for the use of increasing the quality of the lower-quality sectionof visual data; analysing a further one or more example based models forthe use of increasing the quality of the lower-quality section of visualdata; and selecting one or more example based models from a plurality ofexample based models to use based on a specified metric; wherein thequality of the lower-quality section of visual data is able to besubstantially increased using the one or more example based models thatcorresponds to the lower-quality visual data.

In some embodiments, by transmitting a section of lower-quality visualdata over a network together with an example based model to aidreconstruction of high-quality visual data, less data can be transferredover the network to enable a higher-quality visual data to be displayedwhen compared to transmitting higher-quality visual data alone. In someof these embodiments, by selecting one or more example based models froma plurality of example based models, higher-quality visual data isoperable to be reconstructed from the lower-quality visual data and theone or more example based models together. As any example based modelsused in such embodiments are already in existence and just need to beselected and not created, the delay between the recording of thehigher-quality visual data and emission of the reconstructedhigher-quality visual data can be minimised. Some of these embodimentscan therefore be used for the live broadcast of visual data pertainingto an event. As there exists a plurality of example based models, insome embodiments optional analysis of a plurality of models allows forthe selection of an example based model which, when used in thereconstruction of a lower-quality section of visual data, will generatethe highest quality output data on reconstruction compared to otherselectable models. The visual data to be transmitted can be recorded inthe form of higher-quality visual data in some embodiments, the qualityof which is then reduced before transmission as outlined above. Thevisual data can, in alternative embodiments, be recorded in the form oflower-quality visual data, which requires no further decrease in qualitybefore transmission. In some embodiments, visual data can be video andor image data. In some embodiments, quality can relate to the resolutionof visual data and/or other attributes such as a higher or lower framerate.

In some embodiments, a combination of two or more example based modelsmay provide an optimum resource for reconstruction of the lower-qualitysection of visual data. In some of these embodiments, the two or moreexample based models can be combined in such a way so as to form a newexample based model that is transmitted alongside the lower-qualitysection of visual data. The lower-quality section of visual data canfurther be transmitted alongside more than one example based model insome embodiments, if that provides a required level of reconstructioninto a higher-quality visual data.

In some embodiments, the live section of visual data transmitted will beat a lower quality. Aspects disclosed herewith can still be used inorder to increase the quality of the section of visual data in someembodiments, even without an original high-quality version.

Optionally, one or more sample sections of visual data are transmittedfrom the first node to the second node in advance of a livetransmission; and a subset of example based models is selected from theplurality of example based models based on a specified metric from theone or more sample sections of visual data; wherein the one or moreexample based models used to substantially increase the quality of thelive transmission is selected from the subset of example based models.

Optionally, one or more sample sections of visual data are transmittedfrom the first node to the second node in advance of a livetransmission; wherein one or more example based models can be generatedin advance of the live transmission based on a specified metric from theone or more sample sections of visual data.

Optionally, one or more sample sections of visual data are transmittedfrom the first node to the second node in advance of a livetransmission; wherein one or more example based models from theplurality of example based models can be modified in advance of the livetransmission based on a specified metric from the one or more samplesections of visual data.

The process of selecting the example based model to be used in someembodiments can be made more efficient by providing a smaller pool ofexample based models from which the selection can be made. Computationaleffort can thereby not be wasted in at least some of these embodiments,as a reconstruction using an example based model that is very unlikelyto be used as the selected model for the relevant visual data, e.g.frame or video, will not be performed.

In some embodiments, by transmitting a section of visual data in advanceof the live broadcast, example based models that are likely to be usedcan be grouped into a subset of the total plurality of example basedmodels available.

During the live broadcast, in some embodiments, one or more examplebased models can be selected from the subset, rather than from theentire available library of models. If deemed necessary, in at leastsome embodiments, or if sufficient time is available before the livebroadcast in other embodiments, the section of visual data can betransmitted in advance of the live broadcast and this can allow for themodification of an existing example based model or generation of a newexample based model so as to provide a model or models for the moreaccurate reconstruction from a lower-quality section of visual data.

Optionally, the example based model comprises any of: a generativemodel; a non-linear hierarchical algorithm; or a convolutional neuralnetwork; or a recurrent neural network; or a deep belief network; or adictionary learning algorithm; or a parameter; or a mapping function.

Optionally the example based model comprises a specific parameter ormapping function for the reconstruction of data.

In embodiments, the example based model can be one of a number ofdifferent model types. This increases the flexibility of the method andallows accurate reconstruction of the higher quality visual data in suchembodiments.

Optionally the higher-quality visual data is divided into smallersections based on similarities between a plurality of sections of thehigher-quality visual data.

In some embodiments, by dividing the visual data into smaller sectionsor ‘scenes’, based on a particular metric for similarity, more efficientmodels can be generated. For example, in some embodiments multiplesections can be selected, all of which comprise part of a landscapeshot, and only one model will be required to reconstruct the scene asopposed to a marginally different model for every separate section. Ifthe next scene in the visual data is very different, for example a scenewith significant movement, then in some embodiments this will bedetected as such and a new model generated accordingly for the scene.Specific models can be trained for each scene or section in someembodiments, enabling the reconstruction approach to be adaptive and toallow at least some optimisation of reconstruction.

Optionally a section of visual data can comprise any of: a single frame;or a sequence of frames; or a region within a frame or sequence offrames.

Depending on the visual data being processed, in some embodiments modelscan be generated for sections of visual data comprising a single frame,a sequence of frames or a region within a frame or sequence of frames.Each option could be necessary in some embodiments in order to providethe most efficient method of reconstructing a higher-quality version ofa part of the original visual data.

Optionally the visual data is converted to a sequence of sections beforethe quality is reduced.

By separating the visual data into sections, for example by separatingvideo data into a series of frames in some embodiments, the amount ofdata is temporarily increased, as the reductions in data from anycompression methods previously used on the video file will be undone.However in some of these embodiments, this allows for the individualsections to be down-sampled thus reducing the size of the visual data,thereby allowing for lower-quality sections to be transmitted asre-encoded visual data in the original or optionally a more optimalcodec but at a lower quality.

Optionally analysis of any two or more example based models occurs inparallel.

By analysing multiple example based models in parallel in someembodiments, the time taken to select a suitable example based modelfrom a library of models can be reduced. This is especially beneficialfor live broadcasting embodiments, where it can be advantageous for thetime taken for processing visual data before transmission to beminimised.

In some embodiments, a pipeline of analysis can be performed formultiple subsequent sections of visual data in parallel. In some ofthese embodiments, analysis can be performed for subsequent sections ofvisual data in respect of compression settings and/or to classify thesection or sections into categories in order to perform furthercontent-specific analysis, where this further analysis can be performedonce the visual data has been decoded, and in some embodiments thisanalysis can allow a reduction of the number of models considered foruse with the visual data for enhancement or as starting points fortraining a model.

Optionally, a plurality of example based models are stored in a library.

In some embodiments, a stored library of example based models at thefirst node allows the analysis process to quickly select example basedmodels for comparison without having to obtain them from the network.This, in turn, may result in a faster selection of the most suitablemodel for transmission across the network in some of these embodiments.

Optionally the sections of visual data are transmitted in thechronological order according to the section of higher-quality visualdata.

By transmitting the sections of visual data in chronological order insome embodiments, the time difference between a section of visual databeing recorded and a reconstructed higher-quality visual data beingreceived by the second node can be minimised. For live broadcastingembodiments, this means that the lag between an event happening in frontof a camera and a viewer watching a reconstructed version of the eventcan be reduced.

Optionally the sections of visual data are transmitted in the order inwhich they were transmitted by the first node.

Optionally the quality of the lower-quality sections of visual data isincreased according to the order in which the sections of visual datawere transmitted by the first node.

Some sections of visual data might be easier to process than others, forexample a section of video comprising a single black frame would requireless computational effort to process than a fast-moving scene. Thereforein some embodiments the sections of visual data that are easier toprocess could arrive at the second node before the more difficult toprocess sections. If the visual data is to be reconstructed and viewedin the order in which it was originally recorded in such embodiments,any sections of visual data which arrive out of sequence at the secondnode can be buffered in some of these embodiments and the sectionsplaced in a chosen order, before increasing the quality and outputtingthe reconstructed visual data.

Optionally the analysis of an example based model for the use ofreconstruction of the lower-quality section of visual data comprises thefurther steps of: extracting features of a section of the higher-qualityvisual data; and using the extracted features to select a predeterminedexample based model from the plurality of predetermined example basedmodels to provide initial parameters for the developed example basedmodel.

The closer the features of the example based model match those extractedfrom the corresponding section of visual data, the more accurate areconstruction can be created using that particular example based model,in at least some embodiments. Therefore by extracting features from asection of the higher-quality visual data in some embodiments anappropriate model may be more accurately chosen from the plurality ofexample based models available.

Optionally the specified metric used to select and/or modify and/orgenerate an example based model is based on generating the highestquality output data following reconstruction, preferably wherein qualitycan be defined using any of: an error rate; a peak signal-to-noiseratio; or a structural similarity index.

A reconstructed section of visual data of the highest quality accordingto any of the above metrics can be desirable to a viewer, as it isliable to show the truest representation of the original higher-qualityvisual data, at least for some embodiments. In such embodiments, thebroadcaster of the original higher-quality visual data is also likely toprefer that the viewer sees the visual data as it has been prepared,without distortion from the down sampling and transmission process.

Optionally the higher-quality section of visual data is divided intosmaller sections based on similarities between a plurality of sectionsof the higher-quality visual data.

In some embodiments, by dividing the visual data file into smallersections or ‘scenes’, based on a particular metric for similarity, lessdata needs to be transmitted over the network. For example, in someembodiments multiple sections can be selected, all of which comprisepart of a landscape shot, and only one model will be required toreconstruct the scene to an acceptable level as opposed to a marginallydifferent model for every separate section. If the next scene in thevisual data is very different in such embodiments, for example a scenewith significant movement, then it will be detected as such using theextracted features as described above and a new model can be selectedaccordingly.

Optionally a section comprises any of: a single frame, a sequence offrames and a region within a frame or a sequence of frames.

Depending on the visual data being processed, in some embodiments modelscan be selected for sections of visual data comprising a single frame, asequence of frames and a region within a frame or a sequence of frames.In these embodiments, each or all approaches could be necessary in orderto provide the most efficient method of reconstructing a higher-qualityversion of a part of the original visual data.

Optionally the steps of transmitting the section of lower-quality visualdata to the second node and transmitting to the second node the examplebased model that corresponds to the section of lower-quality visual datatransmitted to the second node occur substantially simultaneously.

By transmitting the lower-quality section of visual data and the examplebased model simultaneously in some embodiments, the reconstructionprocess can be initiated substantially simultaneously on arrival of thedata, as opposed to a delay between the arrival of the section of visualdata and the example based model or vice versa. Both the example basedmodel and the section of visual data are necessary for a higher-qualityversion of the section of visual data to be reconstructed, in someembodiments, and so any delay between their arrivals will result in adelay between the original visual data being transmitted from a firstnode and the reconstructed visual data being viewed at a second node.

Optionally the step of lowering the quality of a section of visual datais performed using down-sampling.

By lowering the quality of the section of visual data in someembodiments, less data needs to be sent across a network from a firstnode to a second node in order for a second node to receive the sectionof visual data. In these embodiments the lower-quality version, togetherwith an example based model to be used for reconstruction, can stillallow for less data to be transmitted than if original higher-qualitysection of visual data is transmitted.

Optionally a library is stored at both the first and second nodes, and areference to one or more example based models from the library at thefirst node is transmitted to the second node.

It can advantageous in some embodiments to minimise the amount of datasent over a network. Higher-resolution videos can comprise significantamounts of data, which can be slow to transmit over existing networkinfrastructures such as the Internet. Some embodiments can provide asolution to the problem of video transmission over a network bytransmitting instead a lower-quality section of video and an examplebased model, as described above. In some embodiments, in order tofurther reduce the amount of data transmitted over a network, alower-quality section of visual data can be transmitted along with areference to an example based model, in lieu of the example based modelitself. In some of these embodiments the reference comprises less datathan the example based model to which it refers. In such embodiments alibrary of similarly referenced example based models can be accessedfrom both the first and second nodes, so that once a model is selectedat the first node and the reference transmitted, the correct model to beused at the second node can be identified.

Optionally, an off-site computing system performs a method comprisingthe steps of: receiving a lower-quality section of visual data;analysing a first example based model for the use of reconstruction ofthe lower-quality section of visual data; analysing a further one ormore example based models for the use of reconstruction of thelower-quality section of visual data; selecting one or more examplebased models from a plurality of example based models to use based on aspecified metric; generating a higher-quality section of visual datafrom the lower-quality section of visual data using the one or moreexample based models that correspond to the lower-quality visual data.

Optionally, there is provided a method further comprising the step of:receiving a higher-quality section of visual data from a third node,before transmitting the higher-quality section of visual data to thefirst node.

Optionally, one or more of the nodes is based in an off-site computingsystem.

In some embodiments off-site, or ‘cloud computing’, systems allow forthe performance of computerised tasks on a server not necessarily localto the site of the recording or reconstruction of a section of visualdata. This allows for more powerful servers to be used according to thebudget available for such services, and hence increased parallelprocessing of different example based models in some of theseembodiments. The off-site system used in such embodiments could alsoprovide a backup of any sections of visual data passing through theservers, thereby offering a solution in the case of loss of data at asite local to the recording or reconstruction of a section of visualdata. If the computing system is scalable, as is preferable, then agrowing amount of visual data processing work can be accommodated shouldthe need arise in these embodiments.

Sub-Pixel Convolutions

According to an aspect, there is provided a method for enhancing one ormore sections of lower-quality visual data using a hierarchicalalgorithm, the method comprising the steps of: receiving one or moresections of lower-quality visual data; enhancing the one or moresections of lower-quality visual data to one or more sections ofhigher-quality visual data using the hierarchical algorithm, wherein atleast the first step of the hierarchical algorithm is performed in alower-quality domain; and wherein the hierarchical algorithm operates inboth a higher-quality domain and the lower-quality domain.

In embodiments, an algorithm performing at least the first processingsteps of as enhancement in a lower quality domain ensures the visualdata is at least partially if not substantially processed whilst stillin lower-quality, reducing the computational complexity of theenhancement. Subsequent processing steps may move to the higher-qualitydomain to undertake further processing and output higher-quality visualdata in such embodiments. Optionally, in some of these embodiments, onlythe last processing step or steps are performed in the higher-qualitydomain.

In some embodiments, resampling into the higher dimension space ofvisual data from a low-quality to high-quality domain happens beforebeing processed through a super resolution network for enhancement, forexample in some of these embodiments being enhanced using bicubicinterpolation, but this enhancing does not add information useful forsuper resolution and forces the network to perform subsequentcomputation in a higher-quality domain when for example extractingfeature maps and performing non-linear mapping. This “initial upscaling”makes the computation of the network/algorithm computationally expensiveand increases memory requirements. In some embodiments, the low qualitydomain is a low resolution domain while the high quality domain is ahigh resolution domain.

Optionally, this method can be used as a filtering approach in place ofother resampling or upsampling filters for use with encoding anddecoding of visual data.

In some embodiments, using the method as a filter for visual data codecscan provide very high computational efficiency, and therefore can alsoprovide minimal energy costs in performing such filtering. In these orother embodiments, the method can provide a filter that is fast and/orflexible in expression and that can perform substantially accuratefiltering in at least some embodiments.

Optionally, an activation function can follow the use of the method as afiltering approach.

Optionally, the first step of the hierarchical algorithm comprisesextracting one or more features from the one or more sections oflower-quality visual data.

In embodiments, extracted features may be used to produce a value orseries of values based on a metric from the input data. In someembodiments, the metric can then be used to select a hierarchicalalgorithm from the library which is most appropriate for the input data,as each hierarchical algorithm has associated metric values based on theinput data from which the models were respectively trained, theselection based on the similarity between the metrics associated withthe input data and each of the pre-trained models.

Optionally, the last step of the hierarchical algorithm comprisesproducing higher-quality visual data corresponding to the lower-qualityvisual data, and at least the last step of the hierarchical algorithmmay be performed in the higher-quality domain.

In some embodiments, by using the last step of the hierarchicalalgorithm to perform enhancement from the lower-quality domain afterfeature maps have been extracted and non-linear mapping has beenperformed in the lower-quality domain, the layers other than the finallayer are less computationally expensive and require less memory than ifthey were operating in high resolution space and the final layer canperform more complex upscaling.

In some embodiments, the final layer can be a sub-pixel convolutionlayer that is capable of upscaling low resolution feature maps into highresolution output, thus avoiding using a non-adaptive generic orhandcrafted bicubic filter, and allowing for a plurality of more complexupscaling filters for each feature map. Further, in some of theseembodiments, having the final layer perform super resolution from thelower resolution space can reduce the complexity of the super resolutionoperation.

Optionally, the higher-quality visual data is at a higher resolutionthan the lower-quality visual data, wherein the lower-quality visualdata may contain a higher amount of artefacts than the higher-qualityvisual data.

In some embodiments, separating the visual data into a series ofsections allows for the individual sections to be down-sampled thusreducing the visual data size, thereby allowing for lower qualitysections to be transmitted as re-encoded visual data in the original oroptionally a more optimal codec but at a lower resolution.

Optionally, the hierarchical algorithm comprises a plurality ofconnected layers, and the connected layers may be sequential.

Optionally, the at least one section lower-quality visual data comprisesany of: a single frame of lower-quality visual data, a sequence offrames of lower-quality visual data, and a region within a frame orsequence of frames of lower-quality visual data. Furthermore, thelower-quality visual data may comprise a plurality of frames of video.

Depending on the visual data being processed, in some embodiment modelscan be generated for sections of visual data comprising a single frame,a sequence of frames or a region within a frame or sequence of frames.In these embodiments, some or each of these options could be used inorder to provide the most efficient method of reconstructing a higherquality version of a part of the original visual data.

Optionally, the hierarchical algorithm differs for each section ofvisual data.

In some embodiments, each section of visual to be transferred is likelyto be at least slightly different from the preceding section. Theseembodiments it can therefore allow for more accurate reconstruction ifthe hierarchical algorithm to be transmitted alongside each section ofvisual data is also different in order to account for these differencesin the sections of visual data. For such embodiments, a new model cantherefore be generated for each section of visual data accordingly.

Optionally, the hierarchical algorithm is selected from a library ofalgorithms.

In some embodiments, providing libraries of algorithms allows selectionof an algorithm from the libraries and allows for modifications to bemade to the stored hierarchical algorithms to enhance the visual data,reducing the computational complexity.

Optionally, the standardised features of the at least one section ofreceived lower-quality visual data are extracted and used to select thehierarchical algorithm from the library of algorithms.

In some embodiments, extracted standardised features are used to producea value or series of values based on a metric from the input data. Inthese embodiments, the metric can then be used to select the pre-trainedmodel from the library which is most appropriate for the input data, aseach model in the library has associated metric values based on theinput data from which the models were respectively trained, theselection based on the similarity between the metrics associated withthe input data and each of the pre-trained models.

Optionally, the hierarchical algorithm to be selected from the libraryof algorithms is based on generating the highest quality version of thelower-quality visual data, preferably wherein quality can be defined byany of: an error rate; a bit error rate; a peak signal-to-noise ratio;or a structural similarity index.

The predetermined metrics used in some embodiments to determine thehierarchical algorithm to be selected can be based on a predictedquality of the output data for each pre-trained model. In some of theseembodiments, quality can be defined by any or all of: an error rate; apeak signal-to-noise ratio; or a structural similarity index.

Spatio-Temporal Approach

According to an aspect there is provided a method for enhancing at leasta section of lower-quality visual data using a hierarchical algorithm,the method comprising the steps of: receiving at least a plurality ofneighbouring sections of lower-quality visual data; selecting aplurality of input sections from the received plurality of neighbouringsections of lower quality visual data; extracting features from theplurality of input sections of lower-quality visual data; and enhancinga target section based on the extracted features from the plurality ofinput sections of lower-quality visual data.

In some embodiments, performing the enhancement on the extractedfeatures reduces the computational expense of the enhancement by usinghierarchical algorithms trained on the lower-quality visual data.

Optionally, the target section corresponds to one of the receivedplurality of neighbouring sections of lower-quality visual data.Alternatively, the target section may not correspond to one of thereceived plurality of neighbouring sections of lower-quality visualdata.

In some embodiments, having the target section correspond to one of thereceived sections allows the enhancement to work in the spatial domain.Conversely, in some embodiments, when the target section does notcorrespond to one of the received sections, then enhancement can be usedto predict sections occurring between received sections, oralternatively to predict future sections.

Optionally, the at least one section of lower-quality visual datacomprises any of: a single frame of lower-quality visual data, asequence of frames of lower-quality visual data, and a region within aframe or sequence of frames of lower-quality visual data. Thelower-quality visual data may further comprise a plurality of frames ofvideo.

Depending on the visual data file being processed, in some embodimentsmodels can be selected for sections of visual data comprising a singleframe, a sequence of frames or a region within a frame or sequence offrames. In these embodiments each could be necessary in order to providethe most efficient method of reconstructing a higher quality version ofa part of the original visual data.

Optionally, at least one of the plurality of selected input sections andthe target sections are frames of lower-quality visual data, and the atleast one of the plurality of selected input sections occurssequentially before the target section. Furthermore, at least one of theplurality of selected input sections and the target sections may beframes of lower-quality visual data, and the at least one of theplurality of selected input sections may occur sequentially after thetarget section.

In some embodiments, having one of the selected input sections occursequentially in time before or after the target section of thelower-quality visual data enables the enhancement to predict a possiblefuture section, or section still to be received, but that is notincluded in the any possible target section. As such, in some of theseembodiments, having a section before or after the target section mayalso enable the enhancement to predict a section occurring between twosections.

Optionally, the hierarchical algorithm comprises a plurality of layers,furthermore the layers may be any of sequential, recurrent, recursive,branching or merging.

Having a number of layers in some embodiments, which may or may not besequential, recurrent, recursive, branching or merging allows differentlevels of processing to occur at different times and the layers can workin parallel, ensuring optimal efficiency when enhancing thelower-quality visual data.

Optionally, the extracting the subset of features is based upon apredetermined extraction metric.

In some embodiments, enabling a variety of features to be extracted asset by the predetermined extraction metric ensures the enhancement canbe tailored to a particular system. As such, in some of theseembodiments the computational expense can increased or decreasedappropriately based on system resources.

Optionally, the received plurality of neighbouring sections oflower-quality visual data are consecutive sections of lower-qualityvisual data.

In some embodiments the use of consecutive sections of lower-qualityvisual data enables more accurate enhancement of the lower-qualityvisual data. Receiving a plurality of sections or consecutive sectionsproviding more information used to be able to be used when enhancingsections around the received sections of lower-quality visual data.

Optionally, a predetermined algorithm metric used to determine thehierarchical algorithm to be selected.

In some embodiments, having a plurality of predetermined algorithmswhich may be selected based on a predetermined algorithm metric ensureoptimal efficiency when enhancing the visual data by having a library ofhierarchical algorithms which have already been determined to enhancethe quality of visual data. In these embodiments, these predeterminedalgorithms may then be used as a basis for further enhancements.

Optionally, predetermined algorithm metric is based on generating thehighest quality version of the lower-quality visual data, preferablywherein quality can be defined by any of: an error rate; a bit errorrate; a peak signal-to-noise ratio; or a structural similarity index.Furthermore, standardised features of the received plurality ofneighbouring sections of lower quality visual data may be extracted andused to select the hierarchical algorithm from the library ofalgorithms.

In some embodiments, a reconstructed section of visual data of thehighest quality according to any of the above metrics can be desirableto a viewer, as it is liable to show the truest representation of theoriginal higher-quality visual data. In these embodiments, thebroadcaster of the original higher-quality visual data is also likely toprefer that the viewer sees the visual data as it has been prepared,without distortion from the down sampling and transmission process.

Optionally, other data can be provided to the algorithm. Optionally, theother data can be optical flow between frames. Optionally, the opticalflow between frames can be calculated outside of the algorithm or can bepart of the training of the algorithm.

In some embodiments, other data can be fed into the network, such asoptical flow between the frames or a measure thereof. In theseembodiments, the optical flow can be calculated separately outside theneural network or can be incorporated into the training of the neuralnetwork. In these embodiments, this data can simply be concatenated ontothe end of each frame data. In some embodiments it is not sent duringtransmission. In other embodiments, a variant of optical flow can beextracted from the encoded video (as it forms a basis of the inter-framecompression).

Enhancing Visual Data

According to an aspect there is provided a method for enhancing at leasta section of lower-quality visual data, the method comprising steps of:receiving at least a section of the lower-quality visual data; selectinga hierarchical algorithm from a plurality of hierarchical algorithms,wherein the step of selection is based on a predetermined metric andwherein the hierarchical algorithms were developed using a learnedapproach and at least one of the hierarchical algorithms is operable toincrease the quality of the lower-quality visual data; and using theselected hierarchical algorithm to increase the quality of thelower-quality visual data to create a higher-quality visual data.

Some embodiments provide a method for enhancing at least a section ofvisual data that has been transmitted across a network. In theseembodiments, by selecting a hierarchical algorithm based on apredetermined metric, a suitable hierarchical algorithm can be chosenfrom a library of algorithms that will be able to more accuratelyrecreate the original visual data than a generic hierarchical algorithm.

Optionally, the lower-quality visual data is divided into smallersections based on similarities between a plurality of sections of theoriginal visual data.

In some embodiments, by dividing the visual data into smaller sectionsor ‘scenes’, based on a particular metric for similarity, more efficientmodels can be generated. For example, in some embodiments multiplesections can be selected, all of which comprise part of a landscapeshot, and only one hierarchical algorithm will be required to removeartefacts from the scene as opposed to a marginally different model forevery separate section. In some of these embodiments, if the next scenein the visual data is very different, for example a scene withsignificant movement, then it will be detected as such and a newhierarchical algorithm can be generated accordingly. In someembodiments, specific hierarchical algorithms can be trained for eachscene or section, enabling the artefact removal approach to be adaptiveand to allow at least some optimisation of the artefact removal.

Optionally, the predetermined metric is based on a content-type and ameasure of artefact severity of the lower-quality visual data.Furthermore, the artefact severity may be based on at least one artefactwhich may be any one of, or combination of: blocking, blurring,pixelation, ringing, aliasing, missing data, and other marks, blemishes,defects, and abnormalities in visual data.

In some embodiments, by basing the predetermined metric on the artefactseverity of the lower-quality visual data, the artefact correction modelresulting from the training and optimisation process can be referencedby the artefact severity of the scene it relates to. In theseembodiments, this allows for a more accurate selection of a suitableartefact removal model when selecting a model from the library to cleannew visual data.

Optionally, the plurality of hierarchical algorithms is any of:pre-trained hierarchical algorithms on example data; or manually createdhierarchical algorithms.

In some embodiments, a pre-trained hierarchical or manually createdhierarchical algorithm will be able to more accurately recreate theoriginal visual data than a generic artefact removal hierarchicalalgorithm

Optionally, if a suitable hierarchical algorithm is not present in theplurality of hierarchical algorithms, a generic hierarchical algorithmis selected instead.

In some embodiments, a generic hierarchical algorithm may be usedinstead of a specific, trained model in situations where the library ofalgorithms does not include a visual data artefact removal model thathas been trained on a similar enough content type and artefact graded tothe received visual data. In these embodiments, the generic hierarchicalalgorithm may then be more accurate in removing the artefacts than thespecifically trained hierarchical algorithms available.

Accelerating Machine Optimisation Processes

According to an aspect, there is provided a method for training learnedhierarchical algorithms, the method comprising the steps of: receivinginput data; generating metrics from the input data; selecting at leastone hierarchical algorithm from a plurality of predeterminedhierarchical algorithms based on comparing the generated metrics fromthe input data and like metrics for each of the plurality ofpredetermined hierarchical algorithms; developing the selectedhierarchical algorithm based on the input data; and outputting adeveloped hierarchical algorithm.

Providing a plurality of pre-trained sets of parameters or models insome embodiments allows the training of a machine learning process to beaccelerated. In these embodiments, input data to be processed by atrained machine learning process can have a tailored model, or set ofparameters, developed for that input data based on the selected mostsimilar pre-trained model. In such embodiments, the selection of the oneor more most similar pre-trained model(s) can be done based on one ormore metrics associated with the pre-trained models compared to theinput data. In at least some of these embodiments the most similarpre-trained model can be used as a starting point for developing thetailored model for the data as a tailored model does not have to undergoas extensive development as needed when developing a model from firstprinciples. In some embodiments, using a similar or the most similarpre-trained model can also help with avoiding or escaping local minima(for incorrect solutions) during training.

Optionally, the method further comprises the step of storing thedeveloped hierarchical algorithm with plurality of predeterminedhierarchical algorithms along with the generated metrics from the inputdata.

In some embodiments, each new tailored model is then stored in a libraryof pre-trained models. In these embodiments, repeating or identicalinput data can re-use a tailored model that already exists without anyfurther modification. In such embodiments, the closer a model is to anoptimised version the less computation is required to generate a moreoptimal model. In these embodiments, as more signals and data areprocessed, an increasingly more extensive collection of models can beestablished in the library, requiring reduced development for tailoredmodels for new data thereby saving computational effort.

Optionally, the plurality of predetermined hierarchical algorithms maybe any of: pre-trained hierarchical algorithms on example data; ormanually created hierarchical algorithms.

In some embodiments, the predetermined hierarchical algorithms can bebased on example data or manually created to allow a user to createspecific behaviours in any eventual trained model or set of parameters.

Optionally, the step of developing the selected hierarchical algorithmmay be based on the input data comprises developing a more optimisedhierarchical algorithm.

In some embodiments, developing the predetermined hierarchicalalgorithms can improve the example-based set of parameters to create amore optimised set of parameters.

Optionally, the hierarchical algorithm comprises at least one of any of:a specific parameter for the reconstruction of data; or a mappingfunction for the reconstruction of data.

In some embodiments, each hierarchical algorithm can be used to providefor the reconstruction of data. In some of these embodiments, thereconstruction process can vary, and therefore the model can comprisedifferent features, coefficients and/or parameters that would allow forreconstruction and each layer of the hierarchical algorithm can comprisefeatures, coefficients and/or parameters. Further, in some embodiments,the parameters for the reconstruction of visual data can comprise one ormore hierarchical algorithms.

Optionally, the plurality of hierarchical algorithms may be stored in arepository.

For ease of access to the plurality of predetermined example-basedmodels, in some embodiment the models can be stored in a repository. Inthese embodiments, the repository can take the form of a library. Insome embodiments, the repository can be located on a remote deviceand/or distributed computing system (such as a cloud computing and/orstorage service and/or distributed networked system or peer-to-peersystem).

Optionally, the method may comprise the further steps of: extractingfeatures of the input data; and using the extracted features to select apredetermined hierarchical algorithm from the plurality of predeterminedhierarchical algorithms to provide initial parameters for the developedhierarchical algorithm.

In some embodiments, extracted standardised features are used to producea value or series of values based on a metric from the input data. Inthese embodiments, the metric can then be used to select the pre-trainedmodel from the library which is most appropriate for the input data, aseach model in the library has associated metric values based on theinput data from which the models were respectively trained, theselection based on the similarity between the metrics associated withthe input data and each of the pre-trained models.

Optionally, the metrics may be based on generating the highest qualityoutput data, preferably wherein quality can be defined using any of: anerror rate; a peak signal-to-noise ratio; a distance metric; asimilarity measure; or a structural similarity index.

In some embodiments, the predetermined metrics used to determine thehierarchical algorithm to be selected is based on a predicted quality ofthe output data for each pre-trained model. In some of theseembodiments, quality can be defined by any or all of: an error rate; apeak signal-to-noise ratio; or a structural similarity index.

Optionally, the hierarchical algorithm is selected based on providingoptimal initialisation data when in use

By providing initialisation data which is optimal in at least someembodiments, thereby being as close as possible to the section of visualdata being analysed, fewer iterations are required to adapt the modelinto a form to allow for the highest quality reconstruction according toany of the metrics above. In these embodiments, computational effort andtime is therefore reduced when processing the section of visual data.

Enhancing Model Libraries

According to an aspect, there is provided a method for enhancing visualdata when communicating visual data over a network from a first node toa second node, the method at the first node comprising the steps of:developing at least one modified hierarchical algorithm from a knownhierarchical algorithm operable to substantially recreate at least onesection of higher-quality visual data; transmitting to the second nodereferences to one or more known hierarchical algorithms from which themodified hierarchical algorithms were developed; and transmitting to thesecond node one or more modifications to the one or more knownhierarchical algorithms operable to reproduce the one or more modifiedhierarchical algorithms from the known hierarchical algorithms; whereinthe second node is able to recreate substantially the higher-qualityvisual data using the modified hierarchical algorithm.

According to another aspect, there is provided a method for enhancingvisual data when communicating visual data over a network from a firstnode to a second node, the method at the second node comprising thesteps of: receiving a reference to a known algorithm corresponding to asection of higher-quality visual data; receiving correspondingmodifications to the known hierarchical algorithm operable to produce amodified hierarchical algorithm, the modified hierarchical algorithmdeveloped with the knowledge of the section of higher-quality visualdata; and using the modified algorithm to substantially recreate thesection of higher-quality visual data.

In some embodiments, knowledge of the section of higher-quality visualdata can comprise knowing the encoder settings and/or the contentcategory for at least one of the low-quality visual data, originalvisual data and the higher-quality visual data. In some of theseembodiments, the content category can be based on a predetermined set ofcategories or a determines set of categories.

According to a further aspect, there is provided a system for enhancingvisual data when communicating visual data over a network, the systemcomprising two or more nodes, wherein a first node is configured to:develop at least one modified hierarchical algorithm from a knownhierarchical algorithm operable to substantially recreate at least onesection of higher-quality visual data; transmit to the second nodereferences to one or more known hierarchical algorithms from which themodified hierarchical algorithms were developed; and transmit to thesecond node one or more modifications to the one or more knownhierarchical algorithms operable to reproduce the one or more modifiedhierarchical algorithms from the known hierarchical algorithms; whereina second node is configured to: receive a reference to a known algorithmcorresponding to a section of higher-quality visual data; receivecorresponding modifications to the known hierarchical algorithm operableto produce a modified hierarchical algorithm, the modified hierarchicalalgorithm developed with the knowledge of the section of higher-qualityvisual data; and use the modified algorithm to substantially recreatethe section of higher-quality visual data.

In some embodiments, by transmitting a reference to a known algorithmand modifications to that algorithm that allow a modified algorithm tobe produced to enable reconstruction of a high-quality section or seriesof sections of visual data, less data can be transferred over a networkto enable a high-quality visual data to be viewed compared totransmitting the high quality visual data. In some of these embodimentsthe algorithms, also known as models, representations or functions, canalso be more accurate and therefore enable a more accuratereconstruction, i.e. produce a higher quality high-quality visual data,for example where quality can be measured by a low error rate incomparison to the original high-quality visual data.

Optionally, known hierarchical algorithm is selected from a library ofhierarchical algorithms stored at the first node.

Optionally, the reference received by the second node corresponds to aknown hierarchical algorithm stored in a substantially matching libraryat the second node.

Optionally, if the second node cannot identify the known hierarchicalalgorithm, the second node sends a request to the first node fortransmission of the known hierarchical algorithm from the first node tothe second node.

In some embodiments, by providing common or synchronised libraries ofalgorithms at both the first and the second nodes, and by transmitting areference or reference identifier when transmitting the correspondinglower-quality visual data to allow selection of matching algorithms fromboth libraries using the reference identifier to identify the selectedalgorithm, only the reference identifier, the lower-quality visual dataand the modifications to the stored hierarchical algorithms need to betransmitted between the nodes thus data transmission is reduced as thefull algorithm doesn't need to be transmitted.

Optionally, the modified hierarchical algorithm is stored in a libraryat the first node after being developed.

In some embodiments, by storing the newly developed algorithm at thefirst node, the algorithm may be used as a starting point to developfurther modified algorithms for similar high quality visual data,increasing the efficiency of the method in future situations.

Optionally, the modified hierarchical algorithm is stored in a libraryat the second node after transmission of the one or modifications to theknown hierarchical algorithm from the first node to the second node.

In some embodiments, storing the modified algorithm at the second nodeafter it has been recreated from the known algorithm and the transmittedmodifications allows it to be referenced in the future when the modifiedalgorithm is used as a starting point to develop a new algorithm at thefirst node. In such embodiments, this can prevent duplication.

In some embodiments, the first node may transmit known algorithms to thesecond node prior to sending the modifications required to make themodified algorithm to ensure that the required known algorithm ispresent at the second node. In such embodiments, this can reduce errors.

Optionally, one or more representations of the one or more sections ofhigher-quality visual data are transmitted to the second node and towhich the one or more modified hierarchical algorithms are applied tosubstantially reproduce the one or more sections of higher-qualityvisual data.

In some embodiments, by transmitting representations of the higherquality visual data to the second node the reconstruction of the higherquality visual data can be aided by applying the modified reconstructionmodel to the representation, but still with less data being transferredacross the network than if the higher quality visual data had beentransmitted.

Optionally, one or more sections of lower-quality visual datacorresponding to the one or more sections of higher-quality visual dataare transmitted to the second node and to which the one or more modifiedhierarchical algorithms are applied to substantially reproduce the oneor more sections of higher-quality visual data.

Optionally, down-sampling is used to reduce the quality of one or moresections of higher-quality visual data to one or more sections of lowerquality visual data.

Optionally, the one or more sections of lower-quality visual data aregenerated from the one or more sections of higher-quality visual datausing a process of compression and/or quantisation.

In some embodiments, by lowering the quality of the section of visualdata, less data needs to be sent across a network from a first node to asecond node in order for the second node to receive the file. In theseembodiments, the lower quality version together with a model to be usedfor reconstruction can still allow for less data to be transmitted thanif the original higher-quality version of the same section of visualdata is transmitted (where the quality can be determined by theresolution and/or the level of compression).

Strided Convolutions

According to an aspect, there is provided a method for enhancing atleast a section of lower-quality visual data using a hierarchicalalgorithm, the method comprising steps of: receiving at least onesection of lower-quality visual data; extracting a subset of features,from the at least one section of lower-quality visual data; forming aplurality of layers of reduced-dimension visual data from the extractedfeatures; and enhancing the plurality of layers of reduced dimensionvisual data to form at least one section of higher-quality visual datawherein the at least one section of higher-quality visual datacorresponds to the at least one section of lower-quality visual datareceived.

In some embodiments, extracting a subset of features from a section oflower quality visual data enables performance to be increased by onlyperforming the enhancement on the subset of features as opposed to theentirety of the lower quality visual data, thereby reducing the amountof computation, whilst still achieving acceptable enhancements.

Optionally, the extracted subset of features is dependent upon one ormore predetermined factors.

In some embodiments, the use of a predetermined factor to extract thesubset of features enables the method to be tailored to a plurality ofsystems of different capabilities, and allows customisation of theamount of data to extract, allowing for a more accurate selection of areconstruction model to enhance the lower quality visual data in anappropriate amount of time.

Optionally, the number of layers is dependent upon the one or morepredetermined factors.

In some embodiments, the number of layers being based upon the one ormore predetermined factors ensures the reconstructed higher-qualityvisual data corresponds to the lower-quality visual data received.

Optionally, the lower-quality visual data comprises a plurality ofsections of video data.

In some embodiments, video may be used in the method, enabling thetechniques to be applied to lower-resolution video data and upscaling itto corresponding higher resolution video data.

Optionally, the at least one section of lower-quality visual datacomprises any of: a single frame of lower-quality video data, a sequenceof frames of lower-quality video data, and a region within a frame orsequence of frames of lower-quality video data.

In some embodiments, depending on the visual data being processed,models can be used for sections of video data comprising a single frame,a sequence of frames or a region within a frame or sequence of frames.In some of these embodiments, each option could be necessary in order toprovide the most efficient method of reconstructing a higher resolutionversion of a part of the received video file. In some embodiments,regions can include areas within a section, or segmentation between thebackground and foreground within a section, or some other content-basedsegmentation such as saliency based segmentation (i.e. where on eachsection of visual data a viewer is most likely to look).

Optionally, the hierarchical algorithm differs for each section ofvisual data.

In some embodiments, the use of different hierarchical algorithms foreach section of visual data enables the most efficient hierarchicalalgorithm to be used for a particular section as opposed to using asingle hierarchical algorithm for the entire visual data.

Optionally, the hierarchical algorithm is selected from a library ofalgorithms.

In some embodiments, a library of a plurality of algorithms allows forefficient selection of an hierarchical algorithm from the plurality ofalgorithms without delays due to communication links.

Optionally, standardised features of the at least one section ofreceived lower-quality visual data are extracted and used to select thehierarchical algorithm from the library of algorithms.

Optionally, the hierarchical algorithm to be selected from the libraryof algorithms is based on generating the highest quality version of thelower-quality visual data, preferably wherein quality can be defined byany of: an error rate; a bit error rate; a peak signal-to-noise ratio;or a structural similarity index.

In embodiments, a variety of options are available in order to selectwhich algorithm in the library of algorithms will output the bestenhanced and enhanced visual data from the received visual data, forexample an error rate such as the bit error rate can be used

General Aspects

It should be noted that in some aspects and/or embodiments, the termsmodel and/or algorithm and/or representation and/or parameters and/orfunctions can be used interchangeably.

It should also be noted that visual data, in some embodiments, maycomprise image and/or video data.

Optionally, the modified hierarchical algorithm is trained using alearned approach.

In some embodiments, hierarchical or non-hierarchical algorithms can besubstantially accurate and therefore enable a more accuratereconstruction, i.e. produce higher quality high-quality visual datafrom the low-quality visual data that is transmitted, for example wherequality can be measured by resolution or by a low reproduction errorrate in comparison to the original high-quality visual data. In someembodiments, using a learned approach can substantially tailor thehierarchical model or models for each portion of low-quality visualdata.

Optionally, the learned approach comprises machine-learning techniques.The modified hierarchical algorithm may also be a non-linearhierarchical algorithm, which may comprise one or more convolutionalneural networks.

In some embodiments, non-linear models can be substantially accurate inreconstructing higher-quality sections of visual data thandictionary-based approaches. In these embodiments, through using alearning-based approach, i.e. an approach that does not rely onpre-defined visual data features and operators, the model(s) can beoptimised for each section or sequence of sections.

In some embodiments, the training of convolutional neural networks canbe more computationally complex than dictionary learning for a similaraccuracy, but the resulting model or algorithm can also be more flexiblein representing visual data while using fewer coefficients for thereconstruction. In these embodiments, the resultant convolutional neuralnetwork model to be transmitted alongside the lower-quality visual datacan be both smaller and can be more accurate in the reconstruction of ahigher-quality visual data.

Some aspects can provide an improved technique for generatingreconstruction parameters that can be used, when converting an originalhigh-quality video into a down-sampled low-quality video, to allowrecreation of a higher-quality version of the video from down-sampledlow-quality video without significant loss in quality, for examplehaving a low reconstruction error in comparison with the originalhigh-quality video, and with a reduction in visual data transferred overa network. In such aspects, the application of such a technique canreduce the data transmitted when transmitting visual data in comparisonwith existing techniques while enabling reproduction of the visual dataat its original quality without significant loss in quality incomparison to the original visual data (where quality can be defined byobjective metrics such as error rate, PSNR and SSIM as well assubjective measures). In such aspects, such a proposed technique canallow minimal changes to be made to the overall infrastructure of videoservice providers, as it can augment most existing video compressiontechniques, and can provide advantages in video encoding and videostreaming applications.

Optionally, the higher-quality visual data is at a higher-quality thanthe lower-quality visual data.

Optionally, the lower-quality visual data contains a higher amount ofartefacts than the higher-quality visual data.

Optionally, the hierarchical algorithm performs visual data enhancement,preferably using super-quality techniques.

Optionally, the hierarchical algorithm uses a spatio-temporal approach.

In some embodiments, optionally for use for a section of visual data,the example based model may be a neural network and can usespatio-temporal convolution. In some embodiments, separating visual datainto a series of sections allows for the individual sections to bedown-sampled thus reducing the visual data size, thereby allowing forlower quality sections to be transmitted as re-encoded visual data inthe original or optionally a more optimal codec but at a lower quality.In some embodiments, a spatio-temporal network can allow an improvementin performance by exploiting the temporal information in the visual dataand, for example, within a similar scene in sequential sections ofvisual data, there may be stationary sections of background in thesequential sections providing information relevant for thehigher-quality version of that scene such that temporally consecutivesections can be used to super resolve one section.

Aspects and/or embodiments include a computer program product comprisingsoftware code to effect the method and/or apparatus of other aspectsand/or embodiments herein described.

References to visual data can be references to video data and/or imagedata in some aspects and/or embodiments and vice versa. References tolow-quality and/or lower-quality can be references to low-resolutionand/or lower-resolution in some aspects and/or embodiments and viceversa. References to high-quality and/or higher-quality and/or highestquality and/or original quality can be references to high-resolutionand/or higher-resolution and/or highest-resolution and/or originalresolution in some aspects and/or embodiments and vice versa. Referencesto sections can be references to frames and/or portions of frames insome aspects and/or embodiments and vice versa. References to enhance orenhancement can be references to upscale and/or upscaling in someaspects and/or embodiments and vice versa.

BRIEF DESCRIPTION OF DRAWINGS

Embodiments will now be described, by way of example only and withreference to the accompanying drawings having like-reference numerals,in which:

FIG. 1 illustrates an over-complete dictionary of 16×16 atoms;

FIG. 2a illustrates the layers in a convolutional neural network with nosparsity constraints;

FIG. 2b illustrates the layers in a convolutional neural network withsparsity constraints;

FIG. 3 illustrates the encoding process to generate for transmission,from high-resolution visual data, a combination of low-resolution visualdata and convolutional neural network able to use super resolution toincrease the resolution of the low-resolution data;

FIG. 4 illustrates the decoding process using the low-resolution visualdata and convolutional neural network to recreate a version of thehigh-resolution visual data;

FIG. 5 is a flowchart illustrating the method steps for encoding avisual data for transmission using the process of FIG. 3;

FIG. 6 is a flowchart illustrating the method steps for decoding thevisual data and convolutional neural network data generated using themethod shown in FIG. 5;

FIG. 7 is a diagram of an efficient sub-pixel convolutional networkaccording to an embodiment, featuring two feature map extraction layersbuilt with convolutional neural networks, and a sub-pixel convolutionlayer that aggregates the feature maps from low-resolution space andbuilds the super resolution image in a single step;

FIG. 8 is a diagram of the network architecture according to anembodiment for super resolution using three input frames where only theinput layer is modified to jointly handle three input frames for thesuper resolution prediction of only the middle frame while the hiddenlayers are identical to those in FIG. 7;

FIG. 9 is a flow chart illustrating the method steps for a machinelearning process;

FIG. 10 illustrates the encoding process to generate for transmission,from high resolution visual data and known convolutional neuralnetworks, low resolution visual data and modifications to the knownconvolutional neural network;

FIG. 11 illustrates the decoding process using the low resolution visualdata and a reference to a known convolutional neural network, along withmodifications to that network, to recreate a version of a highresolution visual data;

FIG. 12 illustrates a further encoding process to generate fortransmission, from high resolution visual data and known convolutionalneural networks a modified convolutional neural network; and

FIG. 13 illustrates a further decoding process using a reference to aknown convolutional neural network, along with modifications to thatnetwork, to recreate a version of a high resolution visual data;

FIG. 14 is a flowchart illustrating the method steps for a conventionalimage enhancement process from a lower resolution original visual datato a higher resolution visual data;

FIG. 15 is a flowchart illustrating the method steps for an imageenhancement process according to an embodiment, where visual data isup-scaled from a lower-resolution original visual data to ahigher-resolution visual data, using a combination of the receivedvisual data and a convolutional neural network selected from a library,the convolutional neural network able to use super resolution techniquesto increase the resolution of the received visual data;

FIG. 16 is a flowchart illustrating the method steps for an imageenhancement process to: generate a down-sampled visual data fortransmission from a higher-resolution original visual data; thetransmission of the down-sampled visual; and an image enhancementprocess to upscale from the down-sampled visual data to ahigher-resolution visual data, using a combination of the receiveddown-sampled visual data and a convolutional neural network selectedfrom a library, the convolutional neural network able to use superresolution techniques to increase the resolution of the receiveddown-sampled visual data;

FIG. 17 is a flowchart illustrating the method steps for an imageenhancement process according to the embodiment in FIG. 16, withadditional steps for encoding visual data at another node prior totransmitting the encoded visual data to the node performing the methodof FIG. 16;

FIG. 18 is a flowchart illustrating the method of FIG. 15, with theadditional steps of extracting a reduced dimension representation andconcatenating the visual data to create a reduced dimensionrepresentation of the separated frame;

FIG. 19 is a flowchart illustrating the method of FIG. 16, with theadditional steps of extracting a reduced dimension representation andconcatenating the visual data to create a reduced dimensionrepresentation of the separated scene;

FIG. 20 is a flowchart illustrating the method steps for an imageenhancement process according to the embodiment in FIG. 19, withadditional steps for encoding visual data at another node prior totransmitting the encoded visual data to the node performing the methodof FIG. 19;

FIG. 21 illustrates the selection of pixels from visual data based upona predetermined value to produce reduced resolution visual data forprocessing by the method illustrated in FIGS. 18 through 20;

FIG. 22 illustrates an overview of a method of generating models for usein image artefact removal;

FIG. 23 illustrates a method of using the image artefact removal models;

FIG. 24 illustrates an alternative method of using the image artefactremoval models;

FIG. 25 illustrates the encoding process to generate, for transmission,from high resolution video data, a combination of low resolution visualdata and a reference to an algorithm able to use super resolution toincrease the resolution of the low resolution visual data;

FIG. 26 illustrates the decoding process using the low resolution visualdata and the algorithm corresponding to the received reference torecreate a version of the high resolution visual data; and

FIG. 27 illustrates the method steps of the encoding process to generatefor transmission, from original visual data being recorded through tothe transmitted package of a lower-resolution scene along with ahierarchical algorithm.

DETAILED DESCRIPTION

Various embodiments will now be described in detail with reference tothe Figures referenced above.

Reduction of Complexity in Neural Networks

With reference to FIGS. 2a and 2b , various possible configurations ofneural network for use in at least some embodiments shall now bedescribed in detail.

An example layered neural network is shown in FIG. 2a having threelayers 10, 20, 30, each layer 10, 20, 30 formed of a plurality ofneurons 25, but where no sparsity constraints have been applied so allneurons 25 in each layer 10, 20, 30 are networked to all neurons 25 inany neighbouring layers 10, 20, 30. The example simple neural networkshown in FIG. 2a is not computationally complex due to the small numberof neurons 25 and layers. Due to the density of connections, however,the arrangement of the neural network shown in FIG. 2a won't scale up tolarger sizes of network, i.e. the connections between neurons/layers,easily as the computational complexity soon becomes too great as thesize of the network scales and scales in a non-linear fashion.

Where neural networks need to be scaled up to work on inputs with a highnumber of dimensions, it can therefore become too computationallycomplex for all neurons 25 in each layer 10, 20, 30 to be networked toall neurons 25 in the one or more neighbouring layers 10, 20, 30. Apredetermined initial sparsity condition is used to lower thecomputational complexity of the neural network, for example when theneural network is functioning as an optimisation process, by limitingthe number of connection between neurons and/or layers thus enabling aneural network approach to work with high dimensional data such asimages.

An example of a neural network is shown in FIG. 2b with sparsityconstraints, according to at least one embodiment. The neural networkshown in FIG. 2b is arranged so that each neuron 25 is connected only toa small number of neurons 25 in the neighbouring layers 40, 50, 60 thuscreating a neural network that is not fully connected and which canscale to function with, higher dimensional data—for example as anoptimisation process for video. The smaller number of connections incomparison with a fully networked neural network allows for the numberof connections between neurons to scale in a substantially linearfashion.

Alternatively, in some embodiments neural networks can be use that arefully connected or not fully connected but in different specificconfigurations to that described in relation to FIG. 2 b.

Further, in some embodiments, convolutional neural networks are used,which are neural networks that are not fully connected and thereforehave less complexity than fully connected neural networks. Convolutionalneural networks can also make use of pooling or max-pooling to reducethe dimensionality (and hence complexity) of the data that flows throughthe neural network and thus this can reduce the level of computationrequired. In some embodiments, various approaches to reduce thecomputational complexity of convolutional neural networks can be usedsuch as the winograd algorithm or low-rank matrix approximations.

End-to-End Super Resolution Enhancement Model Generation &Reconstruction

Although initially designed to enhance single image frames, superresolution techniques can also be used on multiple frames in someembodiments. To apply these techniques in such embodiments, multiplelow-resolution frames can be gathered together and the sub-pixel shiftsbetween the individual frames can be used to create a higher resolutionimage than the original. In such embodiments, a series of frames can becombined to form a higher resolution video than was originally provided.

To improve on the above described dictionary-based approach for encodingand decoding video using super resolution techniques, in at least someembodiments it is proposed to use deep learning techniques andconvolutional neural network models instead of dictionary learningtechniques and dictionary-based models.

Dictionary learning is closely related to sparse coding techniques,while deep learning is only more loosely connected with sparse coding.Sparse coding is an effective mechanism that assumes any natural imagecan be sparsely represented in a transform domain. Sparse coding is atechnique used to automatically find a small number of representativepatterns which, when combined in the right proportions, reproduce theoriginal input patterns. The sparse coding for an input then consists ofthose representative patterns. From a signal processing perspective, itfollows that complicated signals can be broken down into a small, i.e.sparse, number of simple signals.

The transform domain can be a dictionary of image atoms, which can belearnt through a training process known as dictionary learning thattries to discover the correspondence between low-resolution andhigh-resolution sections of images (or “patches”). Dictionary learninguses a set of linear representations to represent an image and where anover-complete dictionary is used, a plurality of linear representationscan be used to represent each image patch to increase the accuracy ofthe representation.

In at least some embodiments, instead it is proposed to use machinelearning with deep learning techniques that can instead createnon-linear representations of an image or sequence of images.

When using machine learning and sparse coding principles, a trainingprocess is used to find optimal representations that can best representa given signal, subject to predetermined initial conditions such as alevel of sparsity.

When using convolutional neural networks in at least some embodiments,the efficiency in terms of computational and memory cost can beimportant.

In some embodiments, convolutional neural network models (orhierarchical algorithms) can be transmitted along with thelow-resolution frames of video data because the convolutional neuralnetwork models reduce the data transmitted in comparison with learneddictionaries being transmitting along with the low-resolution images,especially in comparison to transmitting learned over-completedictionaries with the low-resolution images, in the case where themodels and dictionaries have the same level of reconstruction accuracy.

The convolutional neural network models of some embodiments allow thereconstruction process and image representation to be non-linear. Thisis in contrast to the dictionary-based approach, which represents imagesin a linear fashion, as described above. The convolutional neuralnetwork models of some embodiments offer reconstruction with afeed-forward mechanism based on image convolution that is able to becomputed in parallel and for which methods with high computational speedare available, such as the AMD® Tiled Convolution approach which can beused for fast image filtering.

The series of convolutions in a convolutional neural network model ofsome embodiments allow the neural network to be used to search for pixelcorrelations in a region far larger than the initial patchdecomposition, but applying a weighting to weaken the importance ofcorrelations for locations further away from the pixel of interest. Incontrast, linear sparse coding approaches like dictionary learning arerestricted to looking for correlations in an initial patch size, toavoid the computational complexity of searching the entire image. As aresult, the method of these embodiments can more fully exploit thenatural or non-local redundancies of the video frames and between asequence of video frames.

In some embodiments, optionally the convolutional neural network modelsonly assume local spatial or spatio-temporal correlations in an image orvideo. This assumption is in contrast to the assumption that small datapatches must be well represented by a restricted number of atoms from adictionary, which is a sparsity constraint applied to dictionarylearning and over-complete dictionary approaches.

In some embodiments, recurrent neural network models can be used.Recurrent neural network models have single layers that are usediteratively. The layers of a recurrent neural network model can beunrolled into a number of layers in order to be treated in a similarfashion to convolutional neural networks, in some embodiments.

Referring now to FIGS. 3 and 5, a technique that can be used in method,apparatus and/or system embodiments to encode video data will now bedescribed in detail.

Original video data 70 is a high-resolution video, for example having aresolution of 1920 pixels by 1080 pixels (also known as “1080p” video)or 3840 pixels by 2160 pixels (also known as “4K” video). This videodata can be encoded in a variety of known video codecs, such as H.264 orVP8, but can be any video data that can be decoded into the componentframes of the video. The original video data 70 is provided as inputvisual data for encoding using the technique.

The original video data 70 is then split into single full-resolutionframes at step 80 (or step 190), i.e. into a sequence of images at thefull resolution and/or quality of the original video data 70. For somevideo codecs, this will involve “uncompressing” or restoring the videodata as, for example, common video compression techniques removeredundant (non-changing) features from sequential frames.

Optionally, at step 90 (or step 190), in some embodiments thefull-resolution frames can be grouped into scenes or sections of frameshaving common features, otherwise known as “scene selection”. The videodata is split or clustered into scenes to enable more specific trainingand optimisation. By scene, it is meant a consecutive group or sequenceof frames, which at the coarsest level can be the entire video, a singleframe or at the most granular level can be or a section/segment of aframe.

The exact approach employed for splitting frames into scenes can beperformed in many ways, depending on embodiment, with the four mainapproaches being described below:

A first approach is the use of the frame-type groupings of theunderlying video codec. In this approach, a scene is defined in theencoded video by each group of pictures (sometimes referred to by theabbreviation “GoP”), for example between two I-frames. This is probablythe simplest approach for scene selection and does not require muchadditional computation to perform scene analysis of the video, but theapproach does not allow any flexibility in the level of granularity inthe definition of each scene.

The second approach is the use of a scene or shot transition detector,for example as described in the paper “A Unified Model for Techniques onVideo-Shot Transition Detection” by Jesús Bescós, Guillermo Cisneros,José M. Martínez, José M. Menéndez, and Julián Cabrera as published inIEEE TRANSACTIONS ON MULTIMEDIA, VOL. 7, NO. 2, April 2005 on pages293-307 which is incorporated herein by reference. This approachproposes a unified detection model to detect camera-shot transitions invideo, detecting both abrupt and gradual camera-shot transitions.

The third approach is the use of a clustering approach after applying anunsupervised learning or dimensionality reduction approach such asK-means clustering or manifold learning or Principle Component Analysis(PCA) etc. A suitable K-means clustering approach is detailed in thepaper “Constrained K-means Clustering with Background Knowledge” by KiriWagstaff, Claire Cardie, Seth Rogers and Stefan Schroedl as published inthe Proceedings of the Eighteenth International Conference on MachineLearning, 2001, p. 577-584. A suitable manifold learning approach isproposed in the paper “Algorithms for manifold learning” by LawrenceCayton published on Jun. 15, 2005. Both of these papers are hereinincorporated by reference.

The fourth approach is to use a range of predefined scene classes andthen automatically classifying scenes using the predefined classes.Examples of this approach can be found in the paper “Nonparametric SceneParsing: Label Transfer via Dense Scene Alignment” by Ce Liu, Jenny Yuenand Antonio Torralba having IEEE reference 978-1-4244-3991-1/09 and thepaper “80 million tiny images: a large dataset for non-parametric objectand scene recognition” by Antonio Torralba, Rob Fergus and William T.Freeman. Both of these papers are herein incorporated by reference.

The exact approach for how a scene is defined is independent from therest of the approach, and will vary by embodiment, although it will havean impact on the training time and the reconstruction performance sothere is a level of optimisation required for each possible embodimentto find a balance between the speed and the accuracy of the scenedetection step.

Alternatively, no scene matching needs to be performed at step 90 (orstep 190) in some embodiments. A further alternative for someembodiments is to perform only very basic time-stamping of the video, todetermine how to reassemble the video frames for later stages in thetechnique, for example during transmission or during playback of thevideo.

Regardless whether the video has been broken into frames or scenes (i.e.groups of multiple frames) in step 90 (or step 190) or remains as asequence of frames from step 80 (or step 190), each frame isdown-sampled into lower resolution frames at a suitably lowerresolution. Optionally, in some embodiments this step can occur beforethe frames are grouped into scenes in step 80 (or step 190), so step 90(or step 190) can be exchanged with step 90 (or step 190) in thesealternative embodiments. The lower-resolution frame can, for example, be33% to 50% of the data size relative to the data size of theoriginal-resolution frame, but in should be appreciated that inembodiments the lower resolution can be any resolution that is lowerthan the original resolution of the video.

In step 110 (or step 200), in at least one embodiment super resolutiontechniques are employed to create a specific model using machinelearning for each frame, so that the model can be used to substantiallyrecreate the original resolution version of a lower-resolution frame andtrained using machine learning based on knowledge of theoriginal-resolution frame. This step is termed the training andoptimisation process. In some embodiments, generic models can bedeveloped for types of scene or frame. Alternatively, in otherembodiments, models can be developed for each scene.

By employing a deep learning approach to generating the model inembodiments, a non-linear hierarchical model can be created in some ofthese embodiments to reconstruct a higher-resolution frame from thelower-resolution frame.

An example of a deep learning approach, but in respect of only stillimages and without use of the original image to optimise thereconstruction model, is described in the paper “Learning a DeepConvolutional Network for Image Super-Resolution” by Chao Dong, ChenChange Loy, Kaiming He, and Xiaoou Tang published in D. Fleet et al.(Eds.): ECCV 2014, Part IV, LNCS 8692, pp. 184-199, 2014 and this paperis incorporated herein by reference. This paper relates to using superresolution techniques when trying to obtain an unknown high resolutionversion of a given low resolution image and proposes the use of aconvolutional neural network to learn mappings between low resolutionand high resolution images.

While the creation of non-linear hierarchical models is morecomputationally complex than creating linear models using dictionarylearning approaches, in at least some embodiments it can be moreflexible. Further, the non-linear models created in some of theseembodiments can use only a few coefficients to enable reconstruction incomparison to the dictionary-based approach, thus such models canrequire less data to be transmitted. Still further, the non-linearmodels used in some embodiments can be more accurate in reconstructinghigher-resolution frames than dictionary-based approaches. Thenon-linear models created in some embodiments are small convolutionalneural networks rather than over-complete dictionaries. In contrast tothe local patch averaging approach that tends to be used inreconstruction by dictionary learning approaches, the use of aconvolutional neural network model in embodiments also allows a moreappropriate filter to be learned for final reconstruction whereneighbouring patches are considered, which can avoid unintendedsmoothing of the reconstructed higher-resolution image.

The training and optimisation process in embodiments can be configuredaccording to a desired trade-off between computational time spent anddesired quality of results. In general, the number of iterations usedduring the training process yields approximately logarithmic gains inreconstruction accuracy, so in some embodiments it is preferred to usean automatic threshold to stop further optimisation. When favouringquality of results in embodiments, the automatic threshold can be set toa predetermined value of reconstruction error, for example bycalculating the mean squared error, but other methods can be used.Alternatively, in some embodiments the automatic threshold can be set tolimit the training and optimisation process to a predetermined number ofiterations. As a further alternative, in some embodiments a combinationof these two factors can be used.

In some embodiments, step 120 (or step 210), the portion of thelow-resolution video and the reconstruction model for that portion ofvideo are output for transmission. Optionally, in some embodiments thevideo and model can be stored together within a suitable data containerformat such as a Matroska Multimedia Container (otherwise known as a MKVcontainer). Alternatively, in some embodiments the video and model canbe combined with other sections or the entire video and placed into asuitable data container format. In some embodiments, at step 120 (orstep 210), the low-resolution video frames can be re-encoded usingeither the original video codec applied to the original video data 70or, alternatively, a more optimal video codec can be applied to thevideo data to produce output video data 130. Optionally, if scenedetection or time stamping was performed, in some embodiments the dataoutput for transmission can include either a list of scenes or timestamp data respectively, or this data could be stored within the datacontainer.

In embodiments there can be a number of variations to the encodingframework described above. For the above described technique, it can beassumed in many embodiments that there would be a one-to-one mappingbetween scene and model, however this does not need to hold true as alocal cluster of scenes could be used to train each model in someembodiments. Conversely, it could also be possible in some embodimentsto use several similar models to initialise (by way of a weightedaverage) initial parameters for training new unseen scenes. It may alsobe sufficient to simply weight the models without requiring any furtheroptimisation in some embodiments—similar to label fusion methods used inmedical imaging for example.

Referring now to FIGS. 4 and 6, embodiments for reconstructing the videoencoded using the technique will now be described in detail.

First, the data 130 is received from the network. In embodiments, thedata received 130 depends on how the data was prepared for transmissionin step 120 (or 210) as detailed above in the various possibleembodiments and the prepared data can include the video data and one ormore reconstruction models for that video data. In some embodiments, itis possible that the video data and one or more reconstruction modelsare not transmitted and/or received simultaneously so some buffering maybe required to wait for all of the components required to decode orreconstruct the higher-resolution video from the data transmitted overthe network.

At steps 140 and 150 (and step 220), the received data is prepared forreconstruction depending on the embodiment. In most embodiments, thisstep involves separating the low-resolution video from thereconstruction models (step 220). Optionally, in some embodiments thelow-resolution video is decompressed using the video codec used fortransmission into full-resolution image frames (step 230) and each ofthe frames is matched up with the corresponding reconstruction model,which are also unpacked into frame-by-frame order (step 240).

At step 160 (step 250), the reconstruction model is applied to each ofthe frames to output higher-resolution frames depending on theembodiment. The reconstruction, or decoding, process in most embodimentsinvolves applying the optimised super resolution convolutional neuralnetwork model, or reconstruction model, for each scene in order torestore the lower-resolution video to its original resolution havingsubstantially the same quality as the original high-resolution video.Given the corresponding models for each lower-resolution frame, theoriginal higher-resolution frames can be reconstructed with highaccuracy for at least some of these embodiments.

The complexity of the reconstruction process can be far simpler, i.e.require less computation, when compared to that of training the model inmost embodiments. In most embodiments, the reconstruction process isvery similar to a single iteration of the training process, howeverthere is no optimisation required and the process simply applies thelearnt convolutional neural network model to reconstruct the image on apatch-by-patch basis. In some embodiments, a singular model is appliedto each scene and can be sent as accompanying data in the videocontainer ahead of the scene in which it is used. In some embodiments,the model associated with each scene can either be indexed in a datastream, synchronised with the video and audio stream, or indexed in aframe-to-model look-up table which can be sent ahead of the video streamdepending on the embodiment.

The image reconstruction in most embodiments has a linear computationalcomplexity, dependent on the total number of pixels of each frame, asthe reconstruction process requires a series of convolution functions(typically less than 3) to be applied for each relevant image patchcentred around each pixel. A basic reconstruction step for each image isas described in the paper “Learning a Deep Convolutional Network forImage Super-Resolution” by Chao Dong, Chen Change Loy, Kaiming He, andXiaoou Tang published in D. Fleet et al. (Eds.): ECCV 2014, Part IV,LNCS 8692, pp. 184-199, 2014, and this step can be used with or withoutmodification in some embodiments however, in some of these embodimentsthese functions can be applied in parallel across multiple images and insome embodiments it can be feasible to perform real-time reconstructionfor video playback.

Super resolution operates on a patch-by-patch basis in most embodiments,but it may not be necessary to perform super resolution for every singlepatch of an image in some embodiments. In some embodiments, where thepatch is flat and smooth, using a bi-cubic upscaling can be sufficient.It may be faster in some embodiments, for both training andreconstruction, if these patches could be bypassed. To identify thesepatches, one approach as set out in the paper “Coupled DictionaryTraining for Image Super-Resolution” by Jianchao Yang, Zhaowen Wang, ZheLin, Scott Cohen and Thomas Huang (as published in IEEE TRANSACTIONS ONIMAGE PROCESSING, VOL. 21, NO. 8, AUGUST 2012), incorporated byreference, can be used in some embodiments to filter out patches whichhave low variances and ignoring these areas of the image. Alternatively,in other embodiments edge detectors could be used instead to identifyareas of interest.

Further still, in some embodiments some level of inter-frame comparisoncan be used to identify regions of the image which do not change fromframe to frame, thereby eliminating areas of the image from duplicatingthe efforts of super resolution reconstruction which occur in a previousframe. In these embodiments the underlying video code for thelow-resolution video can be used to identify the regions of change aspart of its inter-frame compression mechanism and this information couldbe taken advantage for more efficient real-time super resolutionreconstruction and video playback. In addition, in some embodiments anauxiliary data-structure, such as a random fern, can be used to keeptrack of the uniqueness of patches that have been reconstructed. Giventhat an image may contain many repeating patches, use of this approachin some embodiments could prevent unnecessary reconstruction of patcheswhereby the result is already known (in another patch). Similarapproaches have been used in key frame detection for real-time cameralocalisation for augmented reality applications.

The proposed method and system of encoding and decoding video of atleast some of the embodiments can augment existing video compression anddecompression codecs. By using the same codec as used to create thevideo data, the low resolution video that is transmitted can be encodedwith the same video codec but at a lower resolution than that of theoriginal in some embodiments. Thus, in some embodiments the proposedmethod and system can be independent of the original codec used tocreate and compress the video. Alternatively, in some embodiments it ispossible to select an alternative codec for transmission and tore-encode the video back into the original codec when the video data hasbeen transmitted, uncompressed and restored to a high resolution versionof the original video data.

By incorporating, for example in some embodiments, image enhancementtechniques into a video compression process, a reduction in resolutionof the video during transmission can be achieved and thus lower amountsof data are transmitted because the image can be enhanced at the nodereceiving the reduced-resolution video to recreate the video at theoriginal resolution. By using super resolution as the image enhancementtechnique in such embodiments, and with the knowledge of the originalhigh-resolution image before applying image enhancement techniques, itis possible to down-sample the original high-resolution image to alower-resolution image and choose one or more representations from alibrary of representations that can be used to create a high-resolutionimage from the down-sampled image based on the knowledge of the originalimage. In such embodiments, this results in only a down-sampled imageand the super resolution reconstruction model or parameter beingtransmitted over a network instead of the original high resolutionvideo, thus decreasing the amount of data transferred while maintaininga similar level of image quality relative to the original once thehigh-resolution image has been recreated.

At step 170, in some embodiments each of the segments of video areoutput from the reconstruction process as higher-resolution frames atthe same resolution as the original video 70. In these embodiments, thequality of the output video 180 is substantially similar to that of theoriginal video 70, within the error bounds optionally applied by themachine learning process that develops the reconstruction model at step110 (or step 200) of the encoding process.

At step 180, in some embodiments the segments of video are combined suchthat the video can be displayed. Optionally at step 170 or 180, in otherembodiments the video can be re-encoded with the original codec used onthe original video 70 or a more predetermined optimal codec, to enableplayback on a decoder or display device.

In most embodiments, the proposed technique does not performconventional compression by rearranging the original data and discardingredundant data or data deemed to be of least importance such that themajority of the data is intact. Instead, in these embodiments thetechnique determines a series of simple light-weight functions throughmachine learning that can be used to reconstruct the original data whileminimising the reconstruction error given some pre-defined cost function(a number of optimisation or search frameworks common to machinelearning can be used, such as gradient descent or stochastic gradientdescent). Thus, it follows that the technique of these embodiments canbe described as an optimisation process of the reconstruction functionsrather than the data redundancy/reduction process of conventionalcompression techniques.

Sub-Pixel Convolution

Referring now to FIGS. 3 and 5, embodiments using another technique toencode visual data will now be described in detail. These embodimentscan be used in combination with other embodiments and alternative andoptional embodiments described elsewhere in this specification.

Again, in these embodiments, original video data 70 is provided into themethod or system and is a high-resolution video, for example having aresolution of 1920 pixels by 1080 pixels (also known as “1080p” video)or 3840 pixels by 2160 pixels (also known as “4K” video). This videodata can be encoded in a variety of known video codecs, such as H.264 orVP8 but can be any visual data for which the system or method is able todecode into the component sections.

The original video data 70 is then split into single full-resolutionframes at step 80 (or step 190), i.e. into a sequence of images at thefull resolution of the original video data 70. For some video codecs,this will involve “uncompressing” or restoring the video data as, forexample, common video compression techniques remove redundant(non-changing) features from sequential frames.

Optionally, at step 90 (or step 190), the full-resolution frames can begrouped into scenes or sections of frames having common features,otherwise known as “scene selection”. The video data is split orclustered into scenes to enable more specific training and optimisation.By scene, it is meant a consecutive group or sequence of frames, whichat the coarsest level can be the entire video or at the most granularlevel can be a single frame.

To super resolve a low-resolution image to high-resolution space, it isnecessary to increase the dimensionality of the low-resolution image tomatch that of the high-resolution image at some point during theoperation of the example based model or convolutional neural network. Byupscaling the low-resolution image to a high-resolution as an input toan example-based model, the example-based model does not need to learnthe super resolution filters to perform upscaling from thelow-resolution space to a high-resolution space but this approach cansacrifice reconstruction accuracy and introduces computationalcomplexity as all subsequent processing must occur at the highresolution dimensionality.

Referring to FIG. 7, there is shown an efficient sub-pixel convolutionalneural network (ESPCN) 700 having a low-resolution input image 710 withtwo feature map extraction layers 720, 730 built with convolutionalneural networks and a sub-pixel convolution layer 740 that aggregatesthe feature maps from low-resolution space and builds the superresolution image 750 in a single step.

In an embodiment, as shown in FIG. 7, the high-resolution data is superresolved from the low-resolution feature maps only at the very end ofthe network, in the final or last layer of the network, thereforeavoiding the need to perform most of the computation in the largerhigh-resolution dimensionality. As processing speed dependssubstantially directly on the input image dimensionality, operation inthe low-resolution space will allow for faster processing. Further, byperforming feature map extraction before upscaling, more complex andmore accurate upscaling (i.e. additional reconstruction accuracy) ispossible by the final or last layer of the network as an upscaling orresampling function can be learned and is content and data adaptive ascompared to the applying an explicit generic or handcraftedinterpolation filter to perform upscaling (for example, a bicubicinterpolation filter) that is heuristically chosen beforehand.

The task of the example based model, in some embodiments a single imagesuper resolution network, is to estimate a high resolution image given alow resolution image that is downscaled or downsampled from acorresponding high resolution image. In some cases, for example videocompression, the down sampling operation can be deterministic and known:to produce the low resolution image from the high resolution image, thehigh resolution image can be convolved using a Gaussian filter (butother filters can be used), thus simulating a point spread function in acamera, then downsampled by a upscaling ratio r. However general superresolution and upscaling are typically not deterministic and in someembodiments, in order to mitigate for non-deterministic operations,training can be performed for a range of different down samplingoperations. In other embodiments, estimation can be performed, forexample by training a classifier or some visual comparison, andoptionally this could be parametised for the super resolution process insome embodiments. In general, both the low and high resolution imagehave C colour channels, thus can be represented as real-valued tensorsof size H×W×C and rH×rW×C respectively. In some embodiments, rather thanrecovering an high resolution image from an upscaled and interpolatedversion of the low resolution image, instead the low resolution image isused by a three layer convolutional network to avoid upscaling beforethe low-resolution image is fed into the network. In the network, asub-pixel convolution layer is applied to upscale the low resolutionfeature maps to produce a high resolution image using super resolution.

For a network composed of L layers, the first L−1 layers can bedescribed as follows:

f ¹(I ^(LR) ;W ₁ ,b ₁)=Ø(W ₁ *I ^(LR) +b ₁)

f ¹(I ^(LR) ;W _(1:l) ,b _(1:l))=Ø(W ₁ *f ^(l-1)(I ^(LR))+b _(l))

where W_(l), b_(l), lϵ(1, L−1) are learnable network weights and biasesrespectively. W_(l) is a 2D convolution tensor of sizen_(l-1)×n_(l)×k_(L)×k_(L), where n_(l) is the number of features atlevel l, n₀=C, and k_(L) is the filter size and level l. The biasesb_(l) are vectors of length n_(l). The non-linearity function Ø applieselement-wise and is fixed. The last layer f^(l) has to convert the lowresolution feature maps to a high resolution image I^(SR).

In an embodiment, the high-resolution data is super resolved from thelow-resolution feature maps by a sub-pixel convolution layer, to learnthe upscaling operation for image and video super resolution. If thelast or final layer performs upscaling, feature extraction occursthrough non-linear convolutions in the low-resolution dimensions, so asmaller filter size can be used to integrate the same informationrelative to doing so in the high-resolution dimensions thus reducingcomputational complexity.

In an embodiment, the convolutional neural network consists of aplurality of non-linear mapping layers followed by a sub-pixelconvolution layer. The benefit is the reduced computational complexitycompared to a three-layer convolutional network used to represent thepatch extraction and representation, non-linear mapping andreconstruction stages in the conventional sparse-coding-based imagereconstruction methods and using an upscaled and interpolated version ofthe low-resolution input. The convolutional neural network of theembodiment uses learned filters on the feature maps to super resolvedthe low-resolution data into high-resolution data (instead of using handcrafted interpolation or a single filter on the input images/frames).

Instead of using a deconvolution layer to recover resolution frommax-pooling and other image down-sampling layers, according to someembodiments upscaling of a low-resolution image is performed byconvolution.

In an embodiment, convolution is performed with a fractional stride of

$\frac{1}{r}$

in me low-resolution space, which can be implemented by interpolation,perforate or un-pooling from low-resolution space to high-resolutionspace followed by a convolution with a stride of 1 in high-resolutionspace.

In another embodiment, convolution with a stride of

$\frac{1}{r}$

in the low-resolution space is performed with a filter W_(d) of sizek_(s) with a weight spacing

$\frac{1}{r}$

to activate different parts of W_(d) for the convolution. The weightsthat fall between the pixels are not activated and therefore notcalculated. The number of activation patterns is r2 and each activationpattern, according to its location, has at most

$\left( \frac{k_{s}}{2} \right)^{2}$

weights activated. These patterns are periodically activated during theconvolution of the filter across the image depending on differentsub-pixel: mod (x, r), mod (y, r) where x, y are the output pixelcoordinates in high-resolution space. In the situation where mod (k_(s),rks)=0, for a neural network with 1 layers, the low-resolution featuremaps f^(l-1)(I^(LR)) from the last non-linear mapping layer areaggregated to produce the final estimate of the high-resolution imagef^(l)(I^(LR)) using the following formula:

I ^(SR) =f ^(l)(I ^(LR))=PS(W _(L) *f ^(L-1)(I ^(LR))+b _(L)

where W_(L) and b_(L) represent learnable filters and biasesrespectively. The final convolution filter W_(L) is of sizeC_(L-1)×r²C×k_(L)×k_(L), where C is the number of colour channels in theoriginal image and r the resampling ratio. PS is a periodic shufflingoperator. Thus, after the convolution, but before applying PS, we have atensor that has dimension rH×rW×C×r², where h and v are horizontal andvertical dimensions of the high-resolution image. The result of applyingPS is a rH×rW×C array, i.e. the same dimensions as the high-resolutionimage. This is achieved by periodic shuffling PS described in thefollowing way:

${{PS}(T)}_{x,y,c} = T_{{\lbrack\frac{x}{r}\rbrack},{\lbrack\frac{y}{r}\rbrack},{{c \cdot r \cdot {{mod}{({y,r})}}} + {c \cdot {{mod}{({x,r})}}}}}$

It is easy to see that when

$k_{L} = \frac{k_{s}}{r}$

and mod (k_(s), r)=0it is equivalent to sub-pixel convolution in thelow-resolution space with the filter W_(d). This last layer, orsub-pixel convolution layer, produces a high resolution image from thelow resolution feature maps directly, with a more distinguishable filterfor each feature map and can operate with increased efficiency as theoperation of the periodic shuffling described can be processed inparallel in a single cycle.

Given a training set consisting of high resolution image examples I_(n)^(H R), n=1 . . . N, the corresponding low resolution images I_(n)^(L R), n=1 N are generated, and the pixel-wise mean squared error (MSE)of the reconstruction is calculated as an objective function to trainthe network:

${l\left( {W_{1\text{:}L},b_{1\text{:}L}} \right)} = {\frac{1}{r^{2}{HW}}{\sum\limits_{x = 1}^{rH}{\sum\limits_{x = 1}^{rW}\left( {I_{x,y}^{HR} - {f_{x,y}^{L}\left( I^{LR} \right)}} \right)^{2}}}}$

Referring to FIG. 8, there is shown a network architecture 800 for superresolution using three input frames 810 a, 810 b and 810 c (and then 810b, 810 c and 810 d). Only the input layer of the neural network ismodified to jointly handle three input frames for the super resolutionprediction of only the middle frame 830 b (or 830 c). The hidden layers820 a, 820 b) are identical to those shown in FIG. 7.

As shown in FIG. 8, in an embodiment, spatio-temporal convolutions areperformed in the initial layer of the neural network. Using aspatio-temporal input layer as an extension of the network to handlevideo data allows reconstruction performance to be improved for videodata by exploiting the temporal redundancy between consecutive frames ina video.

In some embodiments, the settings l=3, (f₁, n₁)=(5, 64), (f₂, n₂)=(3,32), and f₃=3 can be used. In the training phase of these embodiments,17r×17r pixel sub-images were randomly selected from the training groundtruth images I^(HR), where r is the upscaling factor. In otherembodiments, other parameters can be chosen based on the availablecomputing hardware and/or training time. To synthesise the lowresolution samples I^(LR), I^(HR) were blurred using a Gaussian filterin these embodiments and were sub-sampled by the upscaling factor. Inthese embodiments, the sub-images were extracted from original imageswith a stride of (17−Σ mod (f, 2))×r from I^(HR) and a stride of (17−Σmod (f, 2)) from I^(LR). In other embodiments, arbitrary sizedsub-images can be selected: smaller sub-images can enable faster updatesin training (as updates can be made faster since fewer convolutions arerequired per sub-image) and can also allow more individual trainingexamples to be used and can further allow an increase inrepresentations; while larger sub-images can be more process-efficientfor batch systems, particularly where there is sufficient training dataavailable. It can be noted that in most embodiments the lower limit onsub-image size is dependent on the filter sizes used in a neural networkwhile the upper limit is memory- and dataset-related. This ensures thatall pixels in the original image appear once and only once as the groundtruth of the training data. tan h may be used as the activation functionin these embodiments. In some embodiments, the training may stop afterno improvement of the cost function is observed after 100 epochs. Insome of these embodiments, the initial learning rate may be set to 0.01and final learning rate may be set to 0.0001 and updated gradually whenthe improvement of the cost function is smaller than a threshold μ.

In some embodiments, the network is adapted for video super-resolutionwith a modification to the input layer. Instead of handling singleframes independently, consecutive frames are jointly processed byfeeding the consecutive multi-frame data such that the input can beexpressed or converted into a three-dimensional vector of correspondingpatches from multiple frames such that the temporal changes betweenconsecutive frames are captured to the network. In an alternativeembodiment, fixed temporal sampling can be used where videos havevarying or different frame rates, optionally selecting the lowest framerate when the network is trained. After patch extraction, the data isprocessed by hidden layers through the network and results in an outputlayer producing a single frame of high-resolution image corresponding tothe network prediction of the middle frame in the input consecutiveframes. In some alternative embodiments, there are both multiple inputframe and multiple output frames.

In use for video processing, blocks of 3, 5 and 7 (or more) consecutivevideo frames may be used to super resolve the middle frame or frames. Itshould be noted that an increased number of frames could becomeimpractical as each additional frame provides decreasingly less of again in accuracy. In order to handle the first and last frames of videosthat do not have enough neighbouring frames to form a block ofconsecutive frames, the first and last frame may be repeated 1, 2 and 3times respectively. The peak signal to noise ratio (PSNR) may be used asthe performance metric to evaluate the models used.

Referring now to FIGS. 4 and 6, an embodiment for reconstructing thevideo encoded using the technique will now be described in detail.

First, the data 130 is received from the network. The data received 130depends on how the data was prepared for transmission in step 120 (or210) as detailed above and will include the video data and one or morereconstruction models for that video data. It is possible that the videodata and one or more reconstruction models are not transmitted and/orreceived simultaneously so some buffering may be required to wait forall of the components required to decode or reconstruct thehigher-resolution video from the data transmitted over the network.

At steps 140 and 150 (and step 220), the received data is prepared forreconstruction. This step generally involves separating thelow-resolution video from the reconstruction models (step 220).Optionally, the low-resolution video is decompressed using the videocodec used for transmission into full-resolution image frames (step 230)and each of the frames is matched up with the correspondingreconstruction model, which are also unpacked into frame-by-frame order(step 240).

At step 160 (step 250), the reconstruction model is applied to each ofthe frames to output higher-resolution frames. The reconstruction, ordecoding, process involves applying the optimised super resolutionconvolutional neural network model, or reconstruction model, for eachscene in order to restore the lower-resolution video to its originalresolution having substantially the same quality as the originalhigh-resolution video. Given the corresponding models for eachlower-resolution frame, the original higher-resolution frames can bereconstructed with high accuracy.

In a further embodiment, at least a portion of the process describedwithin FIG. 3 can take place within a ‘cloud computing’ system. In thisembodiment, original video data 70 is transmitted to an off-sitecomputing system wherein one or more of the processes outlined in thisspecification take place. A different section of video data may beprocessed in parallel on the off-site computing system. The limit of thenumber of sections of video processed in parallel is dependent on thecomputational complexity of the sections of video and the processingpower of the cloud servers. Once the cloud-based processing is complete,data can be transmitted back to a local computing system. The cloudservice can be used as a real-time relay server, receivinglower-resolution videos, the resolutions of which are then to beincreased before being re-transmitted. This arrangement can relay datafrom bandwidth-restrained locations to locations where there is not sucha constraint on bandwidth.

In a further embodiment, the training process for the example basedmodels takes place exclusively for the reconstruction of thehigh-frequency components of the higher-resolution section of video. Theresults may then be added as a residue to a section of videoreconstructed using bi-cubic interpolation.

In a further embodiment, the architecture of any convolutional neuralnetworks used in the reconstruction process is amended such that theupscaling, in terms of physically changing the number of pixels, occursin the middle or the last layer of the network by way of a deconvolutionfunction. The first layer of the network is described as obtaining lowresolution features whilst the high resolution features are only learntin the last layer. It is not necessary to learn the low resolutionfeatures in a high resolution space. By keeping the resolution low forthe first couple of layers of convolutions, the number of operationsrequired can be reduced. The computational performance then depends moreon the resolution of the input rather than resolution of the output.Alternatively, the network layers can be reorganised such that theoutput of the sub-pixel convolution layer of the convolutional neuralnetwork (which can be the last layer or a preceding layer, depending onthe embodiment) predicts the square of the upscaling factor number ofpixels (e.g. r²) instead of the number of upscaling factor pixels (e.g.r). The other pixels represent the neighbouring pixel to the originalinput pixel in low resolution. Every 4 pixels must then be reshaped andreordered to form the high resolution image. A higher video processingspeed can be obtained using this approach whilst maintaining a highlevel of quality for the output. The number of convolutions required istherefore reduced. This embodiment may be used in conjunction with anyother embodiment.

In some and other embodiments, a neural network can have multi-stageupscaling (or other function) where an earlier layer upscales and then alater layer upscales, for example a middle layer upscales by 2× and thenthe last layer upscales by 2×. This type of “chained” approach can allowfor neural networks to be trained in a long network (or “chain”) offunctional layers, for example having a range of upscaling factors (e.g.2×, 3× and 4×) with multiple upscaling layers and output layers. One ofmore of these layers can be sub-pixel convolution layers of thedescribed embodiments.

The complexity of the reconstruction process is far simpler compared tothat of training the model. The process is very similar to a singleiteration of the training process however there is no optimisationrequired and it is simply applying the learnt convolutional neuralnetwork model to reconstruct the image on a patch-by-patch basis. Thesize of a single patch may vary, according to the resolutionrequirements of the output section of video. The patch size will bedetermined offline via hyper-parameter optimisations when trainingmodels. Generally, a larger patch size will reduce the computationalrequirements for processing a section of video, and also reduce thebandwidth required to transmit the section of video. When bandwidth isparticularly limited, the processing power of an end user terminal islow, or a user is willing to endure a lower quality section of video,the patch size may be increased to allow for video transmission underone or more of those circumstances. The quality of the reconstructionwill be compromised but the processing power required at the end-userterminal will be significantly reduced.

A singular model is applied to each scene and can be sent asaccompanying data in the video container ahead of the scene in which itis used. The model associated with each scene can either be indexed in adata stream, synchronised with the video and audio stream, or indexed ina frame-to-model look-up table which can be sent ahead of the videostream.

At step 170, each of the segments of video are output from thereconstruction process as higher-resolution frames at the sameresolution as the original video 70. The quality of the output video 180is substantially similar to that of the original video 70, within theerror bounds optionally applied by the machine learning process thatdevelops the reconstruction model at step 110 (or step 200) of theencoding process.

At step 180, the segments of video are combined such that the video canbe displayed. Optionally at step 170 or 180, the video can be re-encodedwith the original codec used on the original video 70 or a morepredetermined optimal codec, to enable playback on a decoder or displaydevice.

The use of the final layer to perform super resolution can be used toperform upscaling for low-resolution images and/or video withoutknowledge of any original high-resolution content or where there is nohigher-resolution content for the low-resolution images and/or video.Additionally, the use of the spatio-temporal approach can be used toperform upscaling for low-resolution images and/or video withoutknowledge of any original high-resolution content or where there is nohigher-resolution content for the low-resolution images and/or video.Further, both the use of the final layer to perform super resolution andthe use of the spatio-temporal approach can be used in combination toperform upscaling for low-resolution images and/or video withoutknowledge of any original high-resolution content or where there is nohigher-resolution content for the low-resolution images and/or video.Specifically, some embodiments can use one or more generic example basedmodels, for example selecting these from a library of generic examplebased models and for example applying some criteria in selecting suchexample based models, that use either or both of example based modelshaving a final layer that performs super resolution and/or use aspatio-temporal approach in the input layer of the example based model.

Real Time Model Development/Selection

Referring now to FIG. 27, an embodiment using the technique to encodevisual data will now be described in detail. These embodiments can beused in combination with other embodiments, and alternative and optionalportions of embodiments, described elsewhere in this specification.

Original video data 2740 can be provided into the method or system ofthe embodiment using a camera 2735 and usually comprises ahigh-resolution video, for example having a resolution of 1920 pixels by1080 pixels (also known as “1080p” video) or 3840 pixels by 2160 pixels(also known as “4K” video). This video data can be encoded in a varietyof known video codecs, such as H.264 or VP8, but can be any video datafor which the system or method is able to decode into the componentframes of the video depending on the embodiment.

In some embodiments. the original video data 2740 is then split intosingle full-resolution frames within step 150 i.e. into a sequence ofimages at the full resolution of the original video data 140. In some ofthese embodiments, for some video codecs, this will involve“uncompressing” or restoring the video data as, for example, commonvideo compression techniques remove redundant (non-changing) featuresfrom sequential frames.

In some embodiments, model selection or at least initial model selectioncan be performed based on the uncompressed video data.

Optionally, within step 2750, in some embodiments the full-resolutionframes can be grouped into scenes or sections of frames having commonfeatures, otherwise known as “scene selection”. The video data is splitor clustered into scenes to enable more specific optimisation. By scene,it is meant a consecutive group or sequence of frames comprising asection of video, which at the coarsest level can be the entire video orat the most granular level can be a single frame. In some embodiments,the scenes can be arranged according to the order in which they werefilmed or into a sequence for appropriate decoding of any group ofpictures (as scenes will typically comprise related visual content andappropriate ordering can allow compression to work efficiently, forexample).

In some embodiments, regardless whether the video has been broken intoframes or scenes (i.e. groups of multiple frames) in step 150 or remainsas a sequence of frames from step 140, each frame can down-sampled intolower-resolution frames at a suitably low resolution. Optionally, insome embodiments this step can occur before the frames are grouped intoscenes in step 150. In some embodiments, the lower-resolution frame isoptionally 33% to 50% of the data size relative to the data size of theoriginal-resolution frame, but can be any resolution that is lower thanthe original resolution of the video. In other embodiments, the qualitycan be reduced by quantisation and/or compression instead of reducingthe resolution of the visual data or in addition to reducing theresolution of the visual data.

At step 2755, a scene is selected in some embodiments. In thisembodiment used for real-time encoding, this scene can initially be thefirst frame chronologically that was recorded by the camera 2735, or thefirst frame appearing in the original video file 2740. Following thisframe, a second frame to be recorded or a second frame appearing in theoriginal video file 2740 can next be selected. After that would appear athird frame, and so on, until the broadcast was complete.

A first example based model is taken from a library of example basedmodels and analysed for use in the reconstruction of data in step 2760.A second example based model can be taken and analysed in parallel instep 2770, as can a third example based model as shown in step 180.There is no fixed upper limit to the variable n, variable n being thenumber of example based models which can be analysed in parallel, wheren is at least two.

In step 2795, the most accurate example based model is chosen to be usedfor the reconstruction of data. The most accurate example based modelcan be defined as an example based model which would result in thehighest quality of reconstruction, wherein quality can be defined usingany of: an error rate; a peak signal-to-noise ratio; or a structuralsimilarity index when compared to the original video file 2740.

In step 210, the lower-resolution scene and the example based model forthe reconstruction of that scene are output for transmission over anetwork. Optionally, a reference to the model can be transmitted in lieuof the actual model. This requires a synchronised or matched library atboth the transmitting and receiving nodes of the process, such that thereference can be used by the library at the transmitting node, and themodel identified from the reference to the same model in the library atthe receiving node as in the library at the transmitting node.

Optionally, the video and model (or model reference) can be storedtogether within a suitable data container format such as a MatroskaMultimedia Container (otherwise known as a MKV container).Alternatively, the video and model can be combined with other sections,or the entire video and placed into a suitable data container format. Atstep 210 the low-resolution video frames can be re-encoded using eitherthe original video codec applied to the original video data 2740 or,alternatively, a more optimal video codec can be applied to the videodata to produce a smaller output file. Optionally, if scene detection ortime stamping was performed, the data output for transmission caninclude either a list of scenes or time stamp data respectively, or thisdata could be stored within the data container.

There can be a number of variations to the encoding framework describedabove. For the above described technique, it can be assumed that therewould be a one-to-one mapping between scene and example based model,however this does not need to hold true as each scene could beaccompanied by more than one example based model.

Referring now to FIG. 5, an embodiment for reconstructing the videoencoded using the technique will now be described in detail.

First, the transmitted data 210 is received from the network. The datareceived 210 depends on how the data was prepared for transmission instep 2750 as detailed above and will include the video data and one ormore reconstruction models for that video data. It is possible that thevideo data and one or more reconstruction models are not transmittedand/or received simultaneously so some buffering may be required to waitfor all of the components required to decode or reconstruct thehigher-resolution video from the data transmitted over the network.

At step 220, the transmitted data is prepared for reconstruction. Thisstep comprises separating the low-resolution video from the one or moreexample based models. Optionally, the low-resolution video isdecompressed using the video codec used for transmission intofull-resolution image frames and each of the frames is matched up withthe corresponding reconstruction model, which are also unpacked intoframe-by-frame order.

At step 250, the reconstruction model is applied to each of the scenesto output higher-resolution scenes. The reconstruction, or decoding,process involves applying the optimised super resolution convolutionalneural network model, or reconstruction model, for each scene in orderto restore the lower-resolution video to its original resolution havingsubstantially the same quality as the original high-resolution video.Given the corresponding models for each lower-resolution scene, theoriginal higher-resolution scenes can be reconstructed with highaccuracy, where accuracy is defined as above.

This embodiment requires no optimisation, and comprises applying apreviously learnt example based model to reconstruct a scene, and doesnot necessarily include any adaptation or modification of the existingexample based models in the library. The one or more example basedmodels associated with each scene can be indexed in a data stream,synchronised with the video and audio stream, or indexed in aframe-to-model look-up table that can be sent ahead of the video stream.

The image reconstruction has a linear computational complexity dependenton the total number of pixels of each frame, as it requires a series ofconvolution functions (typically less than 3) to be applied for eachrelevant image patch centred around each pixel. The basic reconstructionstep for each image can be used with or without modification in someembodiments from the approach described in the paper “Learning a DeepConvolutional Network for Image Super-Resolution” by Chao Dong, ChenChange Loy, Kaiming He, and Xiaoou Tang published in D. Fleet et al.(Eds.): ECCV 2014, Part IV, LNCS 8692, pp. 184-199, 2014, however thesefunctions can be applied in parallel across multiple images and it isfeasible to perform real-time reconstruction for video playback.

Within step 250, each of the segments of video is output from thereconstruction process as higher-resolution frames and at substantiallythe same resolution as the original video 2440.

Further within step 250, the segments of video are combined such thatthe video can be displayed. Optionally the video can be re-encoded withthe original codec used on the original video 2740 or a predeterminedmore optimal codec, to enable playback on a decoder or display device.

In a further embodiment, at least a portion of the process describedwithin FIG. 27 can take place within a ‘cloud computing’ system. In thisembodiment, the original video file 2740 is transmitted to an off-sitecomputing system, preferably a scalable computing system, where thefirst scene is prepared 2750. As before, a plurality of example basedmodels 2760, 2770, 2780, 2790 can then be analysed for their use inreconstruction of the data, before a most accurate model 2795 is chosenand a transmitted package 210 prepared. The transmitted package 210 isthen sent from the cloud server to a local server, where thereconstruction process 220, 230, 240, 250 can take place. While thefirst scene is being processed in this way, a second section of videocan be processed in parallel on the off-site computing system. The limitof the number of sections of video processed in parallel is dependent onthe computational complexity of the sections of video and the processingpower of the cloud servers. The cloud service can be used as a real-timerelay server, receiving lower-resolution videos, the resolutions ofwhich are then to be increased before being re-transmitted. Thisarrangement can relay data from bandwidth-restrained locations tolocations where there is not such a constraint on bandwidth.

In a further embodiment, one or more sections of video are transmittedvia the process outlined above, in advance of a live recording. Examplebased models that are likely to be useful can therefore be identifiedbefore they are required, and the library of models from which they areselected reduced to those more likely to be used. The selectionprocedure 2795 can therefore be made faster or with reduced computation,as there are fewer models to choose between, hence the lag between therecording of an event and the higher-resolution reconstruction beingdisplayed can be reduced compared to comparing the performance of all ofthe models in the library of models.

Model Libraries

Referring now to FIG. 25, an embodiment using another technique toencode visual data will now be described in detail. These embodimentscan be used in combination with other embodiments, and alternative andoptional portions of embodiments, described elsewhere in thisspecification.

Original video data 2510 is provided into the method or system using thetechnique and is a high-resolution video, for example having aresolution of 1920 pixels by 1080 pixels (also known as “1080p” video)or 3840 pixels by 2160 pixels (also known as “4K” video). This videodata can be encoded in a variety of known video codecs, such as H.264,VP8 or VP9 but can be any video data for which the system or method isable to decode into the component frames of the video.

The original video data 2510 is then split into single full-resolutionframes at step 2520, i.e. into a sequence of images at the fullresolution of the original video data 2510. For some video codecs, thiswill involve “uncompressing” or restoring the video data as, forexample, common video compression techniques remove redundant(non-changing) features from sequential frames.

Optionally, at step 2520, the full-resolution frames can be grouped intoscenes or sections of frames having common features, otherwise known as“scene selection”. The video data is split or clustered into scenes toenable more specific training and optimisation. By scene, it is meant aconsecutive group or sequence of frames, which at the coarsest level canbe the entire video or at the most granular level can be a single frame.

Regardless of whether the video has been broken into frames or scenes(i.e. groups of multiple frames) or remains as a sequence of frames,each frame is down-sampled into lower resolution frames at a suitablylower resolution for transmission over a network, for example theInternet. Optionally, this step can occur before the frames are groupedinto scenes in step 2520. The lower-resolution frame is optionally 25%to 50% or 10% to 50% of the data size relative to the data size of theoriginal-resolution frame, but the lower resolution can be anyresolution that is lower than the original resolution of the video. Thiswill result in the full lower resolution video being smaller in sizethan the original-resolution video.

An analysis step 2530 is performed on the frames of the down-sampledvideo in order to find a reconstruction model from a library that can beused to increase the resolution of the scene and enhance the quality ofthe video. A model is selected based on one or more metrics of theselected scene that can be compared to metrics associated with thereconstruction models stored in the library, and an image enhancementprocedure is performed on the down-sampled scene. The quality of theenhanced scene is compared with the original using objective metricssuch as error rate, PSNR and SSIM and/or subjective measures. Anappropriate model is then selected at step 240 based on these qualitycomparisons. The library from which the models are selected comprises aset of pre-trained models which have been generated from example, ortraining, videos and which are associated with metrics to enablecomparison of the video from which the models were generated with theselected scene being enhanced. The library from which the model isselected may be stored at one or more specific nodes in the network, ormay be distributed over two or more nodes.

By employing a deep learning approach when creating the models, anon-linear hierarchical model can be selected to reconstruct ahigher-resolution frame from the lower-resolution frame.

The non-linear models are more accurate in reconstructinghigher-resolution frames than dictionary-based approaches. Thenon-linear models selected are small convolutional neural networksrather than over-complete dictionaries. In contrast to the local patchaveraging approach that tends to be used in reconstruction by dictionarylearning approaches, the use of a convolutional neural network modelalso allows a more appropriate filter to be selected for finalreconstruction where neighbouring patches are considered, which canavoid unintended smoothing of the reconstructed higher-resolution image.

In step 2550, the portion of the low-resolution video and a libraryreference for reconstruction model for that portion of video are outputfor transmission. Optionally, the video and library reference can bestored together within a suitable data container format such as aMatroska Multimedia Container (otherwise known as a MKV container).Alternatively, the video and library reference can be combined withother sections or the entire video and placed into a suitable datacontainer format. At step 2550, the low-resolution video frames can bere-encoded using either the original video codec applied to the originalvideo data 2510 or, alternatively, a more optimal video codec can beapplied to the video data to produce output video data. Optionally, ifscene detection or time stamping was performed, the data output fortransmission can include either a list of scenes or time stamp datarespectively, or this data could be stored within the data container.Optionally, a list (or data stream) of model references that issynchronised with the output low resolution video frames can also beincluded. Alternatively, the transmission package can include a list ofreferences to library content/models/parameters for each frame, whichcan be ordered by either frame playback or decode order, and this can besynchronised to the video frames. A further alternative is that thetransmission package can include a list of scene transitions (at definedframe intervals) and then a list of references to librarycontent/models/parameters for a matching number of scenes ortransitions.

Referring now to FIG. 26, an embodiment for reconstructing the videoencoded using the technique will now be described in detail.

First, the data 2610 is received from the network. The data received2610 depends on how the data was prepared for transmission in step 2550as detailed above and will include the video data and one or morelibrary references to reconstruction models for that video data. It ispossible that the video data and one or more library references are nottransmitted and/or received simultaneously so some buffering may berequired to wait for all of the components required to decode orreconstruct the higher-resolution video from the data transmitted overthe network.

At steps 2620 and 2630, the received data is prepared forreconstruction. These steps generally involve separating thelow-resolution video from the library references to reconstructionmodels. Optionally, the low-resolution video is decompressed using thevideo codec used for transmission into full-resolution image frames andeach of the frames is matched up with the corresponding libraryreference to a reconstruction model, which are also unpacked intoframe-by-frame order.

At step 2630, the reconstruction model corresponding to the libraryreference is obtained from a stored library of reconstruction models andat step 2640 is applied to each of the frames to outputhigher-resolution frames. The reconstruction, or decoding, processinvolves applying the reconstruction model for each scene in order torestore the lower-resolution video to its original resolution havingsubstantially the same quality as the original high-resolution video.Given the corresponding models for each lower-resolution frame, theoriginal higher-resolution frames can be reconstructed with highaccuracy.

The complexity of the reconstruction process is far simpler compared tothat of training the model. The process, known as the feed-forwardprocess or pass for neural networks, is very similar to a singleiteration of the training process however there is no optimisationrequired and it is simply applying the selected convolutional neuralnetwork model to reconstruct the image on a patch-by-patch basis. Incomparison, training neural networks can also incorporate aback-propagation process or pass, depending on embodiment. A singularmodel is applied to each scene and the library reference to it can besent as accompanying data in the video container ahead of the scene inwhich it is used. The library reference associated with each scene caneither be indexed in a data stream, synchronised with the video andaudio stream, or indexed in a frame-to-model look-up table which can besent ahead of the video stream.

At step 2650, each of the segments of video are output from thereconstruction process as higher-resolution frames at the sameresolution as the original video 210. The quality of the output video issubstantially similar to that of the original video 210, within theerror bounds optionally applied by the machine learning process thatselects the reconstruction model at step 2650 of the encoding process.

At step 2650, the segments of video are combined such that the video canbe displayed. Optionally at step 2650, the video can be re-encoded withthe original codec used on the original video 2510 or a morepredetermined optimal codec, to enable playback on a decoder or displaydevice.

Upscaling & Visual Data Enhancement

Super resolution approaches are usually split into learning- orexample-based approaches and interpolation-based (multi-frame)approaches. Some embodiments are concerned only with learning- orexample-based approaches to super resolution. Specifically, theseembodiments can work with most or all learning- or example-basedtechniques where there can be a set of different upscaling resultsdepending on the selected parameters for the techniques.

In some embodiments, super resolution techniques can outputrepresentations that can be used to enhance the higher-resolution imagescreated from lower-resolution images. To improve the effectiveness ofthese representations in some embodiments, learning- or example-basedapproaches incorporate machine learning. When using dictionaryrepresentations for images, this combination is generally referred to asdictionary learning. In dictionary learning, where sufficientrepresentations are not available in an existing library ofrepresentations (or there is no library available), machine learningtechniques are employed to tailor dictionary atoms such that they canadapt to the image features and obtain more accurate representations.

It is noted that atoms are not selected locally within the dictionary,but instead are chosen as the linear combination that best approximatesthe signal patch for a maximum number of atoms allowed and irrespectiveof their location within the dictionary. Without a constraint that theatoms must be orthogonal to one another, larger dictionaries than thesignal space that the dictionary is intended to represent can becreated.

Embodiments can use dictionary learning reconstruction models orconvolutional neural network reconstruction models for up-scaling, or amixture of these two techniques. In some embodiments, a library ofreconstruction models is stored that can be generated from example, ortraining, video data where both the original and reduced-resolutionvideo can be compared. Along with the reconstruction models, in someembodiments data needs to be stored relating to the example or trainingvideo for each reconstruction model in the library to enable each modelto be matched to a scene that is being up-scaled. In these embodimentsthe data stored relating to the example or training video can bemetadata or metrics related to the video data, or it can be samples orfeatures of the example or training video.

Referring now to FIG. 15, embodiments using a technique 1500 to increasethe resolution of visual data will now be described in detail. Theseembodiments can be used in combination with other embodiments, andalternative and optional portions of embodiments, described elsewhere inthis specification.

In these embodiments, received video data 1540 is provided into adecoder system and is a lower-resolution video encoded in a standardvideo format. This video format can be a variety of known video codecs,depending on the embodiment, and in embodiments can be codecs such asH.264 or VP8 or can be any visual data which the system is able todecode into component sections.

In embodiments, the system then separates video data 1510 into singleframes at step 1520, i.e. into a sequence of images at the fullresolution of the received video data 310. For some video codecs,depending on the embodiment, this will involve “uncompressing” orrestoring the video data as, for example, common video compressiontechniques remove redundant (non-changing) features from sequentialframes.

Optionally, as shown in FIG. 16, in some embodiments the framesextracted in step 1520 from the video 1510 can be grouped into scenes orsections of frames having common features, otherwise known as “sceneselection” in step 1610. In these embodiments step 1610 involvesidentifying sequential scenes once these are detected. In some of theseembodiments, the detected scenes can enable a more accuratereconstruction model or models to be selected from the library ofreconstruction models as appropriate from the scene or frames within thescene in step 1620, which is a modified version of step 1530 in process1500 where the most appropriate model is selected on a frame-by-framebasis. By scene, it is meant a consecutive group or sequence of frames,depending on embodiment, which at the coarsest level can be the entirevideo or at the most granular level can be a single section of a frame.

Alternatively, and in order for any delay to be reduced between thearrival of the lower resolution video 1510 and the generation of ahigher resolution output video 370, in some embodiments basic sceneselection in step 1610 can be accomplished by grouping frames intoscenes chronologically, for example by applying time stamps andcollecting together a predetermined range of timestamps. Initially, inthese embodiments the first frame or section of frame can be analysedand a metric created to enable reference to the library ofreconstruction models in step 1620. In such embodiments, if a subsequentframe or section of a subsequent frame is sufficiently similar accordingto a comparison metric, then the subsequent frame or frames can beincluded as part of a group of frames with the first frame. In theseembodiments, this process can continue until a subsequent frame is notsufficiently similar to the previous frame or frames, at which point theframe or group of frames are collated into a scene in step 410. in theseembodiment the process then starts to find the next scene, starting fromthe insufficiently similar scene. In such embodiments, each scene isprocessed in the order in which it was decoded from the received video1510.

Returning to the method 1500 shown in FIG. 15, in some embodiments ananalysis step 1530 is performed on the frames of the received video inorder to find a reconstruction model from a library in step 1540 whichcan be used to increase the resolution of the scene and enhance thequality of the video in step 1550, based on a metric of the selectedscene that can be compared to metrics associated with the reconstructionmodels stored in the library. A model in step 1540 is selected, and animage enhancement procedure is performed in step 1550 using both themodel selected in step 1540 on the selected frame generated in step 1520from the received video 1510. The library from which the model isselected in step 1540 comprises a set of pre-trained models which havebeen generated from example, or training, videos and which areassociated with metrics to enable comparison of the video from which themodels were generated with a selected frame being enhanced in step 1550.

There are a number of methods for feature extraction approaches that canbe used to create metrics for each frame and therefore which can bestored in the library in association with the pre-trained reconstructionmodels. In many computer vision applications, a common approach is touse a visual bag-of-words approach. Other popular methods includehistogram extraction and scale invariant feature transform (SIFT) orGIST features. After feature extraction in step 1530, each scene from atarget video can be matched to the “most similar” scene from a libraryin a number of ways in step 1540. The simplest approach is to use apre-defined similarity or distance metric such as, Manhattan distance,Euclidean distance or structural similarity (SSIM) or additionally, alearned distance metric. A k-nearest neighbour (kNN) data-structure suchas a ball-tree or a locality-sensitive hash table can be used tofacilitate a direct nearest-neighbour search. Alternatively, each uniquescene can be thought of as being “labelled”, then a variety of machinelearning scene recognition and matching approaches can be used toclassify new scenes into the “labelled” scenes of the library such asadversarial training techniques, where such techniques involve traininganother neural network to indicate whether the scene is labelledcorrectly.

In step 1560, the reconstructed scene for that section of video isoptionally prepared for output 1510. Optionally at step 1560, the outputvideo 1570 can be re-encoded with the original codec used on theoriginal video 1510 or a more predetermined optimal codec, to enableplayback on a decoder or display device.

It should be appreciated that the term ‘frame’, particularly inreference to grouping multiple frames into scenes, can refer to both anentire frame of a video and an area comprising a smaller section of aframe.

The video 1510 in process 1500 or 1600 can originate from physical mediasuch as a DVD or other physical data storage medium, but can alsooriginate from a local or remote streaming network service.

Referring now to FIG. 17, a modified process 1700 (based on process 1600but which could equally be a modified version of process 1500) is shown.

Here, process 1600 in some embodiments is modified with further steps.Specifically, step 1710 begins with a high resolution video file, forexample at HD resolution. Then, at step 1720, the video is down-sampledto, for example, SD resolution to enable transmission over abandwidth-restricted network. Optionally, in other embodiments,quantisation can be used to lower the bitrate of visual data such asvideo. At step 1730, the lower-resolution or quantised video (dependingon embodiment) is transmitted over a network becoming the input videodata 1510 of either process 1500 or 1600 described above in relation toFIG. 15 or 16 respectively.

Further, output video 1570 in process 1500 or 1600 can be outputdirectly to a display or may be stored for viewing on a display on alocal or remote storage device, or forwarded to a remote node forstorage or viewing as required.

In alternative embodiments, the input video concerned may be media forplayback, such as recorded video or live streamed video, or it can bevideoconference video or any other video source such as video recordedor being recorded on a portable device such as a mobile phone or a videorecording device such as a video camera or surveillance camera.

It should also be appreciated that particular combinations of thevarious features described and defined in any aspects of disclosedimplementations can be implemented and/or supplied and/or usedindependently.

Specific Description—Machine Learning Optimisation

Embodiments relating to a dictionary learning approach withdictionary-based models and embodiments relating to a deep learningapproach using convolutional neural network models will now bedescribed. Other suitable machine learning techniques will also be ableto benefit from using a library of pre-trained model. These embodimentscan be used in combination with other embodiments, and alternative andoptional portions of embodiments, described elsewhere in thisspecification.

Referring now to FIG. 9, an embodiment of a machine learning processwill now be described in detail.

Data 910 is provided to the method or system 900, and may for example bein the form of a video data file or image data. Other data formats mayalso be used. Specific metrics are extracted from, or generated basedon, the data in step 920. The metrics can based on measuring which ofthe pre-trained models generates the highest quality output data.Quality can be defined using any or a combination of: an error rate; apeak signal-to-noise ratio; or a structural similarity index. Thesemetrics are then used to select a pre-trained model from a library 942in step 930. The selected pre-trained model is then developed in step940 so as to be more accurately able to perform the desired outputfunction on the input data 910. The output model 950 can then be used onthe input data 910 either immediately or at in future.

To generate the initial pre-trained models, the same process 900 can beused but instead of inputting live data 910, training or example data isused.

The developed model is then saved in the library 942 in step 941, to beused if required in the future. A model does therefore not have to beredeveloped if similar data is input in the future. The library 942therefore grows as the system is used.

If employing a deep learning approach to generating the model in step940, a non-linear hierarchical model 950 can be created.

The training and optimisation process 900 can be configured according toa desired trade-off between computational time spent and desired qualityof results. In general, the number of iterations used during thetraining process 940 yields approximately logarithmic gains inreconstruction accuracy, so it is preferred to use an automaticthreshold to stop further optimisation. When favouring quality ofresults, the automatic threshold can be set to a predetermined value ofreconstruction error, for example by calculating the mean squared error,but other methods can also be used. Alternatively, the automaticthreshold can be set to limit the training and optimisation process to apredetermined number of iterations. As a further alternative, acombination of these two factors can be used.

This process 900 can be of use in the fields of image and videoenhancement. If the input data 910 is in the form of a section (frame orframes) of video, the selection of an initial model from the library 930can be based on metrics associated with the style of video beingprocessed, for example a fast-moving action scene, or a stationarybackground scene. The model 950 can then be developed in step 940 tomore closely represent the section of video for which it is to be used.The training and optimisation process 900 can also be considered in thecase of image registration and alignment. An initialisation can beprovided which is closer to the most optimal image alignment withregards to a metric, for example a distance metric cost function.

Specific Description—Enhanced Libraries

Referring now to FIG. 10, an embodiment using the technique to encodevisual data will now be described in detail. These embodiments can beused in combination with other embodiments, and alternative and optionalportions of embodiments, described elsewhere in this specification.

Original video data 1010 is provided into the method or system using thetechnique and is a high-resolution video, for example having aresolution of 1920 pixels by 1080 pixels (also known as “1080p” video)or 3840 pixels by 2160 pixels (also known as “4K” video). This videodata can be encoded in a variety of known video codecs, such as H.264 orVP9 but can be any video data for which the system or method is able todecode into the component frames of the video.

The original video data 1010 is then split into single full-resolutionframes at step 1020, i.e. into a sequence of images at the fullresolution of the original video data 210. For some video codecs, thiswill involve “uncompressing” or restoring the video data as, forexample, common video compression techniques remove redundant(non-changing) features from sequential frames.

Optionally, at step 1020, the full-resolution frames can be grouped intoscenes or sections of frames having common features, otherwise known as“scene selection”. The video data is split or clustered into scenes toenable more specific training and optimisation. By scene, it is meant aconsecutive group or sequence of frames, which at the coarsest level canbe the entire video or at the most granular level can be a single frame.

Regardless whether the video has been broken into frames or scenes (i.e.groups of multiple frames) in step 1020 or remains as a sequence offrames, each frame is either down-sampled into lower resolution framesat a suitably lower resolution, or reproduced as a set ofrepresentations of the frame such as a matrix of vectors withgeneralised information for portions of the frame or groups of one ormore pixels. Optionally, this step can occur before the frames aregrouped into scenes. The lower-resolution frame is preferably 33% to 50%of the data size relative to the data size of the original-resolutionframe, while the representations of the frame can be anything from 1% to50% of the data size of the original-resolution frame. The lowerresolution frame can have any resolution that is lower than the originalresolution of the video.

In step 1030, an analysis is performed on frames of the downsampledvideo, or on the representations, or on the models alone in order tofind a reconstruction model from a library of models which can be usedto either recreate a close approximation of the high-resolution videopurely from a model, or recreate a close approximation of thehigh-resolution video from a set of representations of thehigh-resolution video, or increase the resolution of the downsampledvideo and enhance the quality of the video. An initial model is selectedbased on a metric of the selected scene that can be compared to metricsassociated with the reconstruction models stored in the library. Theselection of the initial model may be based on only these metrics, oralternatively multiple initial models may be applied independently tothe downsampled video to produce an enhanced lower-resolution frame orrecreate a frame, the quality of the enhanced or recreated frame beingcompared with the original scene to select the most appropriate initialmodel from the group. The quality of the recreated or enhanced scene iscompared with the original using objective metrics such as error rate,PSNR and SSIM and/or subjective measures. An appropriate model is thenselected at step 1040 based on these quality comparisons as well aswhether to use solely a model, or a set of representations of the frame,or the lower-resolution frame. The library from which the models areselected comprises a set of pre-trained models which have been generatedfrom example, or training, videos and which are associated with metricsto enable comparison of the video from which the models were generatedwith the selected scene being enhanced.

In step 1060, super resolution techniques are employed to create aspecific model using the model selected at step 1040 as the initialmodel and using machine learning for each frame, so that the model canbe used to substantially recreate the original resolution version of alower-resolution frame, or a set of representations, or without use ofeither the original or lower-resolution frame or representations, andtrained using machine learning based on knowledge of theoriginal-resolution frame. This step is termed the training andoptimisation process.

At step 1070, the optimised reconstruction model is saved to the libraryfor future use as an initial model in step 1030.

Alternatively, the modified model can be developed from scratch, withoutusing a known model as a starting point. A known model can then becompared with the generated model to produce a list of modificationsrequired to produce the modified model from the known one.

In step 1050, the portion of the low-resolution video, or therepresentations and/or the reconstruction model for that frame orportion of video are output for transmission. Rather than transmit thefull reconstruction model, a library reference to the initial modelselected at step 1040 can be output, together with the modificationsrequired to produce the reconstruction model from it. Alternatively,instead of the lower-resolution video, transmitting a representation ofthe image can further reduce the data transmitted. As a furtheralternative, only transmitting a model still further reduces the datatransmitted. Optionally, the video or representations and model can bestored together within a suitable data container format such as aMatroska Multimedia Container (otherwise known as a MKV container).Alternatively, the video or representations and model can be combinedwith other sections or the entire video and placed into a suitable datacontainer format. At step 250, the low-resolution video frames can bere-encoded using either the original video codec applied to the originalvideo data 1010 or, alternatively, a more optimal video codec can beapplied to the video data to produce output video data 1050. Optionally,if scene detection or time stamping was performed, the data output fortransmission can include either a list of scenes or time stamp datarespectively, or this data could be stored within the data container.Alternatively, a list of frame by frame references (which are ordered byeither frame playback or decode order) can be used which is synced tothe video frames. Another alternative is to include a list of scenetransitions (as defined by frame numbers) along with an ordered list ofreferences matching the number of scenes. The skilled person willappreciate that other examples are possible.

Referring now to FIG. 11, an embodiment for reconstructing the videoencoded using the technique will now be described in detail.

First, the data 1100 is received from the network. The data received1100 depends on how the data was prepared for transmission in step 1050as detailed above and will include the video data or representations ofthe video data and/or references to one or more initial reconstructionmodels for to recreate high-resolution video data, along with anymodifications to the referenced models required to reproduce the finalreconstruction models. It is possible that the video data orrepresentations, references to the one or more initial reconstructionmodels and the modifications to those models are not transmitted and/orreceived simultaneously so some buffering may be required to wait forall of the components required to decode or reconstruct thehigher-resolution video from the data transmitted over the network.

At steps 1120 and 1130, the received data is prepared forreconstruction. This step generally involves separating thelow-resolution video or representations if transmitted from thereferences to known reconstruction models and the modifications to thosemodels required to reproduce the optimised reconstruction model.Optionally, the low-resolution video is decompressed at step 1120 usingthe video codec used for transmission into full-resolution image framesand each of the frames is matched up with the correspondingreconstruction model, which are also unpacked into frame-by-frame order.

The reconstruction models developed at step 1170 are recreated from thereference to a known reconstruction model and the modifications receivedat step 1110. At step 1130 the received reference is used to locate theknown reconstruction model from which the optimised reconstruction modelwas developed in a library of models stored at the second node. Thereceived modifications are then applied to this known reconstructionmodel at step 1160, recreating the optimised reconstruction model. Afterthis reconstruction has taken place, the optimised reconstruction modelis saved in the library at the second node for future reference at step1170 using the same reference as was used when saving the model to thefirst node's library at step 1170. An incremental (or decremental)counter can be used to create new references for the modified algorithmthat would then be the same for both nodes (in a distributed system).Alternatively this could be performed via a centralised database.

At step 1140, the modified reconstruction model is applied to each ofthe frames or representations if transmitted to output higher-resolutionframes, else are used to reproduce the higher-resolution frames withouta low resolution frame or representations. The reconstruction, ordecoding, process involves applying the optimised super resolutionconvolutional neural network model, or reconstruction model, for eachscene in order to recreate higher resolution video having substantiallythe same quality as the original high-resolution video. Given thecorresponding models and if transmitted each lower-resolution frame orset of representations, a higher resolution frame that is substantiallyvisually identical to the original higher-resolution frames can bereconstructed with high accuracy.

At step 1150, each of the segments of video are output from thereconstruction process as higher-resolution frames at the sameresolution as the original video 210. The quality of the output video1150 is substantially similar to that of the original video 210, withinthe error bounds optionally applied by the machine learning process thatdevelops the reconstruction model at step 1060 of the encoding process.

At step 1140, the segments of video are combined such that the video canbe displayed. Optionally at step 1140, the video can be re-encoded withthe original codec used on the original video 1010 or a morepredetermined optimal codec, to enable playback on a decoder or displaydevice.

A modified embodiment of the above-described method is shown in FIGS. 4and 5. In this embodiment, the downsampled video is not transmitted fromthe first node to the second node. Instead, any data required to producethe reconstructed video can be included in the transmitted modificationsto a known reconstruction model. It is possible that no data is requiredand that only the use of a model is required to reconstructsubstantially the high-resolution video. The second node reconstructsthe video using only the modified reconstruction model obtained byapplying the modifications to the known reconstruction model referencedin the transmission and, if required, the data required to produce thereconstructed video. This method can advantageously be used to reducefurther the amount of data transmitted across the network, reducing theamount of data required to be transmitted.

FIG. 12 shows a further method for encoding video. The initial stepsproceed as in FIG. 10. The higher resolution video 1210 is prepared byseparating it into scenes and down sampling at step 1220. An analysis ofeach scene is performed in step 1230 to determine which known modelswill be used as a starting point for the model optimisation process. Oneor more appropriate models are selected at step 1240 based on a metricof each scene or frame that can be compared to metrics associated withthe reconstruction models stored in the library. The selected knownmodels are optimised at step 1260 using machine learning. However,instead of being trained to reproduce the higher resolution video fromthe downsampled one, they are instead trained to substantially reproducethe higher resolution video 1210 using only the optimised model itselfor the optimised model and any data that can be incorporated into themodel to seed recreation of the video frame or scene. A reference to thestarting known reconstruction model together with the modificationsrequired to reproduce the optimised reconstruction model for each sceneor frame are transmitted to the second node at step 1260, along with alist of scenes if known.

FIG. 13 shows a further method of decoding the received information atthe second node to reproduce substantially the higher resolution video.The package transmitted at step 1260 of FIG. 12 is received by thesecond node at step 1310, and unpacked at step 1320. The references toknown models are used to locate the known reconstruction models storedin a library at the second node at step 1330. The modificationscorresponding to these known reconstruction models are then applied atstep 1340 to reproduce the optimised reconstruction model generated bythe machine learning process in step 1260 of FIG. 12. This model isoptimised to substantially reproduce the original higher resolutionvideo 1260 without the need for it to be applied to a corresponding lowresolution video sample. Hence the second node can substantiallyreconstruct the original high resolution video from only the modifiedreconstruction model. This reconstruction is performed at step 1350, andthe resulting reconstructed higher resolution video is output at step1360.

Specific Description—Artefact Removal

To improve on the above mentioned approaches for image artefact removal,it is proposed to use deep learning techniques and neural networks suchas recurrent neural network and convolutional neural network models.

In some cases fully connected neural networks can't scale up to largersizes of network easily as the computational complexity soon becomes toogreat as the size of the network scales, but this depends on theapplication of the neural network and also other factors such as thekernel and filter sizes.

Neural network models can be transmitted along with the low-resolutionand/or low-bitrate and/or low quality frames of video data because sizeof a convolutional neural network model or recurrent neural networkmodel data is small enough to do so compared with the size of a learneddictionary for the same level of accuracy. In comparison, the data sizeof learned dictionaries means that it is impractical for thesedictionaries to be transmitting along with the low-resolution images,especially in where the dictionaries are learned over-completedictionaries

FIG. 22 illustrates an overview of embodiments of a method of generatingmodels for use in image artefact removal. These embodiments can be usedin combination with other embodiments, and alternative and optionalportions of embodiments, described elsewhere in this specification.

In some embodiments, training image or video file is selected at step2210 from a library of training images or videos stored at a networknode and divided up into frames, sub-images or sequences of images(collectively referred to herein as scenes) at step 2220 depending onits content. In these embodiments, the scene type can then be classifiedinto a particular category depending on its content using a metric.

In some embodiments, at step 2230, image artefacts are purposefullygenerated in the scene by applying aggressive compression and/orquantisation algorithms to the scene, with the level of expectedartefacts being controlled by the compression/quantisation level orquality level. This creates a training scene. In some of theseembodiments an artefact grading technique is applied to this trainingscene at step 2240 to quantify the severity of the induced artefacts.

At step 2250, in some embodiments, an image artefact removal model istrained on the training scene using machine learning techniques. Inthese embodiments the image artefact removal model can be generated suchthat it substantially cleans the training scene of image artefacts. Insome of these embodiments, image quality metrics are used to compare the“cleaned” scene with the original, and the training process can becontinued until the comparison produces results within some pre-definedthreshold.

In some embodiments, the resulting image artefact removal model is thensaved at step 2260, along with metric data relating to the scene typeclassification and an artefact grade relating to the types and/orseverity of the artefacts in the training scene.

The process can be repeated multiple times, depending on the embodiment,on the same training scene with different levels of compression andquantisation in order to train a set of models for different levels ofartefact severity.

The process can also be repeated in some embodiments with differenttraining scenes in order to generate a library of different imageartefact removal models indexed by both their content type and artefactseverity. In these embodiments a “matrix” of library models can becreated, where one axis of the matrix can be thought of as the contenttype, and the other the artefact severity.

Each step of the above method, as used in some embodiments, will now bedescribed in further detail.

The division of the training image or video into a scene or scenes atstep 2220 can be achieved in several different ways in differentembodiments. The training image or video may already be divided intoscenes prior to being stored in the library of training images or videosin certain embodiments, hence this step of the method is not alwaysnecessary. For the training of the image artefact removal model, in someembodiments only one scene is used for each model generated. In theseembodiments a single training image or video may therefore be used totrain multiple different image artefact removal models relating todifferent content types present within the image or video.

Considering first the case of video data, in some embodiments thelibrary video data can be split into single full-resolution frames, i.e.into a sequence of images at the full resolution of the original videodata. For some video codecs, in certain embodiments, this will involve“uncompressing” or restoring the video data as, for example, commonvideo compression techniques remove redundant (non-changing) featuresfrom sequential frames.

Optionally, in other embodiments the full-resolution frames can begrouped into scenes or sections of frames having common features,otherwise known as “scene selection”. In such embodiments, the videodata can be split or clustered into scenes to enable more specifictraining and optimisation. By scene, it is meant a consecutive group orsequence of frames, which at the coarsest level can be the entire videoor at the most granular level can be a single frame or portion of aframe depending on embodiment.

For the training of the image artefact removal model, in someembodiments only one scene is used for each model generated. A singletraining image or video may therefore be used in such embodiments totrain multiple different image artefact removal models relating todifferent content types.

Once a scene has been generated, in some embodiments it is classifiedusing metrics relating to properties of the scene. In embodiments,metrics that can be used for this classification can include probabilityor distance, depending on the classifier type or clustering used in eachembodiment, and some function of the error or differences can beincluded in the metric depending on embodiment. Example metrics caninclude the differences between pixels or histogram differences such asthe sum of absolute differences or Euclidean distance in theseembodiments. Example metrics can also include mean squared error andpeak signal-to-noise ratio in some embodiments. Alternatively, in otherembodiments classification can be performed according to predeterminedtrained classifications, for example there could exist predeterminedtrained classifications for a variety of scenes or objects such asoutdoors, indoors, mountains, bike, etc. The probability would bedetermined by the classifier used in the embodiment, for exampleembodiments could use a statistical similarity measure such as theKullback-Leibler divergence. In other embodiments, a further alternativewould be to use machine learning to develop a metric to be applied tothe image-space, which would determine a formula for the distances. Thisclassification using metrics is used to distinguish between scenescontaining different content in at least some embodiments. The metricdata determined in this way effectively assigns the scene a content typein such embodiments.

After the scene has been generated and classified, in at least someembodiments it is compressed and/or quantised at step 2230. In theseembodiments, the compression of the scene can be implemented using anywell-known lossy image/video compression algorithm. In such embodiments,the quantisation methods may include both colour quantisation, using forexample a median cut algorithm or a clustering algorithm, and frequencyquantisation.

In embodiments, the compression or quantisation process introduces imageartefacts to the scene, producing a training scene that will be usedtogether with the original uncompressed and unquantised version of thescene to train and/or optimise an image artefact removal model. In theseembodiments, different levels of artefact severity can be introduced byvarying the level of compression and/or quantisation performed at thisstage.

Before the training and optimisation process begins in some embodiments,the artefact severity of the training scene is determined at step 2240by using an artefact grading algorithm. Examples of such algorithms thatcan be used in embodiments are found in the paper “No-Reference ImageQuality Assessment in the Spatial Domain” by Anish Mittal, Anush KrishnaMoorthy and Alan Conrad Bovik published in IEEE TRANSACTIONS ON IMAGEPROCESSING, Vol. 21, No. 12, December 2012, which is incorporated hereinby reference. By grading the artefact severity of a training scene inembodiments, image artefact removal models can be trained based on bothscene content type and the severity of the artefacts present.

At step 250 the model training and optimisation process is performed onthe training scene in some embodiments. Super resolution techniques andmachine learning techniques are employed in some embodiments to createan image artefact removal model, such that the model can be used tosubstantially recreate the original “clean” version of the trainingscene. By employing a deep learning approach to generating the model inat least embodiments, a non-linear hierarchical model can be created toreconstruct the original clean scene from the compressed and/orquantised scene.

An example of a deep learning approach, but in respect of only stillimages and in relation to jpeg compression artefacts (but not, forexample, other video artefacts such as motion blur and inter-frameartefacts), but which can be used with or without modification in someembodiments, is described in the paper “Compression Artifacts Reductionby a Deep Convolutional Network” by Chao Dong, Yubin Deng, Chen ChangeLoy, and Xiaoou Tang published as arXiv:1504.06993v1 [cs.CV] 27 Apr.2015 and this paper is incorporated herein by reference. This paper isrelated to generating an improved deep Super Resolution ConvolutionalNeural Network for image artefact removal from a shallow network model.

In some of the embodiments, the quality of the recreated or cleanedscene can be compared with the original using objective metrics such aserror rate, PSNR and SSIM and/or subjective measures. In some of theseembodiments, if the quality is found to be within some pre-definedthreshold, then the model can be saved along with results from aclassifier or outcomes identifying the scene content and the artefactseverity that the model relates to. Otherwise, in some embodiments thetraining process continues until the predefined threshold is met.Alternatively or additionally, in some embodiments a pre-defined numberof iterations of the machine learning process can be used to limit thecomputational time spent training the model.

In some embodiments, the image artefact correction model trained in thisway may be one of a non-linear hierarchical algorithm, a convolutionalneural network, a recurrent neural network, a multi-layer (neural)network, an artificial neural network, a deep belief network, adictionary learning algorithm, a parameter, a mapping function, amulti-layer feed-forward network, a non-linear filter, a dictionary, setor series of parameters or functions, or a series of functions.

In some embodiments, the original training scene generated in the sceneselection process is used to generate multiple models for the same scenecontent type by repeating the compression and quantisation process withdifferent levels of compression and/or quantisation, or by usingdifferent compression and/or quantisation algorithms. In theseembodiments, this approach introduces a different level of artefactseverity to the scene. Further, in some of these embodiments thetraining and optimisation process can then be repeated to generate a newimage artefact removal model for the same content, but a different levelof artefact severity.

In some embodiments, the trained and/or optimised image artefact removalmodels are saved to a library of image artefact removal models. In someof these embodiments, each model in the library is associated with aclassifier identifying the scene content and the artefact severity thatthe model was trained on. In these embodiments, the library cantherefore be thought of as a “matrix” of example based models, with itsrows corresponding to the scene content type, and its columnscorresponding to the image artefact severity.

The library can be stored on a node within a network in certainembodiments.

Referring now to FIG. 23, a method of using the image artefact removalmodels will now be described according to some embodiments.

A section of video or an image is received from a network at a receivingnetwork node at step 2310 in some embodiments. In these embodiments, thedata received depends on how the data was prepared for transmission at atransmitting network node and will include the video/image data orrepresentations of the video/image data. It is possible in some of theseembodiments that video data or representations is not transmitted and/orreceived simultaneously so some buffering may be required to wait forall of the components required before the artefact removal process cantake place.

In some embodiments, at step 2320, the received video or image data isunpacked and divided into scenes depending on its content using theprocess described above in relation to the image artefact removalprocess. In some of these embodiments, the scenes are then classified atstep 2330 using metrics to determine the scene content type.

Alternatively, in other embodiments the received video/image data canalready have been divided into scenes and classified by the transmittingnetwork node, in which case the data received by the receiving node willcontain metadata for each of the scenes contained within it thatidentifies the scene content type.

In either case, in some embodiments, at step 2330, the received scenesare subjected to an artefact grading algorithm or classifier todetermine the level of artefact severity present in the scene. In someof these embodiments the source of these artefacts can be thevideo/image compression and quantisation process performed by thetransmitting node prior to transmission of the video/image data, or theycould be introduced by faulty or lossy network transmission.

In some embodiments, the scene content type and image artefact severityare used to select the image artefact removal model from the library ofimage artefact removal models generated in the model creation processthat best matches the scene content type and artefact severity of thereceived scene. In these embodiments, this matching may be performed atthe receiving network node if the library is stored there.Alternatively, in other embodiments, if the library is stored remotelyfrom the receiving network node, a request for the most suitable imageartefact removal model may be transmitted from the receiving node to thelocation of the model library. In some of these embodiments the modellibrary will then transmit the relevant image artefact removal model tothe receiving network node. If no suitable image artefact removal isstored in the library then a generic model may be used instead. In suchembodiments, a suitable model may be determined, for example, byrequiring that the metric data relating to the content type and theartefact severity of the received video or image data lie within somepredefined range of at least one of the image artefact removal modelsstored in the library.

In some embodiments, the image artefact removal model identified to bethe most suitable (or the generic model in the case that no suitablemodel is present in the library or if the generic model is the mostsuitable model) is then applied to the received scene at step 2350 inorder to substantially recreate the original video/image file largelyfree from image artefacts. In such embodiments, this fidelity correctionprocess can result in a clean reconstructed video/image, which is thenoutput by the receiving node at step 2360.

Referring now to FIG. 24, an alternative method of using the imageartefact removal models according to some embodiments will now bedescribed.

In such embodiments, this method relates to the combined use of imageartefact removal and super resolution techniques to reconstruct a videoor image from a downsampled (i.e. lower resolution than an originalhigher resolution) video or image data received from a network.

In some embodiments, firstly, at step 2410, the data package is receivedfrom the network. In these embodiments, the data received in the packagedepends on how the data was prepared for transmission by thetransmitting network node and can include downsampled video or imagedata or representations of the video or image data and/or details of oneor more reconstruction models for recreating high-resolution video datafrom the downsampled video or image data. In such embodiments, thesedetails may be the reconstruction models themselves, or references toknown reconstruction models stored at the receiving node or on thenetwork.

In some embodiments, it is possible that the video data orrepresentations, references to the one or more initial reconstructionmodels and the modifications to those models are not transmitted and/orreceived simultaneously so some buffering may be required to wait forall of the components required to decode or reconstruct thehigher-resolution video from the data transmitted over the network.

Next, at step 2420, the received data is prepared for reconstruction insome embodiments. In these embodiments, this step generally involvesseparating the low-resolution video/image or representations iftransmitted from the details of the relevant reconstruction models.Optionally, in other embodiments, the low-resolution video or image isdecompressed using the video or image codec used for transmission intofull-resolution scenes and each of the frames is matched up with thecorresponding reconstruction model, which are also unpacked intoscene-by-scene order.

At step 2430, in some embodiments, if the scene content has not alreadybeen determined by the transmitting node, then it is now determined bythe receiving node.

In some embodiments, the unpacked video or image scenes are then gradedto determine their artefact severity using an artefact gradingalgorithm.

In some embodiments, at step 2440, the scene content type and imageartefact severity are used to select the image artefact removal modelfrom the library of image artefact removal models generated in the modelcreation process that best matches the scene content type and artefactseverity of the received scene. In such embodiments, this matching canbe performed at the receiving network node if the library is storedthere. Alternatively, in other embodiments where the library is storedremotely from the receiving network node, a request for the mostsuitable image artefact removal model can be transmitted from thereceiving node to the location of the model library. In such embodimentsthe model library will then transmit the relevant image artefact removalmodel to the receiving network node. If no suitable image artefactremoval model is stored in the library then a generic model may be usedinstead in some of these embodiments.

in some embodiments, the image artefact removal model identified foreach scene is then applied to the downsampled scene at step 2450 inorder to substantially recreate the original downsampled imagetransmitted by the transmitting node. Alternatively, in otherembodiments the identified model can be used after the upscaling processof step 2460 to substantially remove the upscaled image artefacts fromthe recreated higher resolution video.

At step 2460, in some embodiments the relevant reconstruction models arethen applied to each of the scenes to output higher-resolution scenes.In such embodiments the reconstruction, or decoding, process can involveapplying the optimised super resolution convolutional neural networkmodel, or reconstruction model, for each scene in order to recreatehigher resolution video or image having substantially the same qualityas the original high-resolution video or image from which thedownsampled video or image was generated by the transmitting node. Giventhe corresponding reconstruction models and each lower-resolution sceneor set of representations, in some embodiments a higher resolution framethat is substantially visually identical to the originalhigher-resolution frames can be reconstructed with high accuracy.

In some embodiments, the reconstructed higher resolution scene is thenoutput by the receiving node at step 470.

The above-described process is performed as a post-process to thestandard decompression process used at the decoding node for receivedtransmissions of, for example, video after the conventional decodingstep and therefore “outside” the traditional compression pipeline in atleast some embodiments.

Alternatively, in other embodiments, the image artefact removal processcan be performed as part of the upscaling process itself. In suchembodiments, several reconstruction models can be trained to reproducethe higher resolution image or video at the first node from a number ofdifferent downsampled images or videos, each with a different artefactseverity. In such embodiments, these can either all be transmitted withthe downsampled video, or the required model can be transmitted to thesecond network node from the first node once a request for the modelcontaining the artefact severity of the received downsampled image orvideo has been sent from the second node to the first node. In eithercase, in some embodiments the model best matching the artefact severityof the received downsampled image or video is used to substantiallyrecreate the original high resolution video.

Spatio-Temporal Interpolation

In some embodiments, visual data being received may be of a lower thandesirable quality, such as at a low resolution or a low frame rate. Itwill be appreciated other features may render the visual data lower thandesirable quality. One or more hierarchical algorithms may be used toincrease the quality of the visual data to a more desirable quality. Forexample, in some embodiments, the hierarchical algorithm may increasethe resolution of the received visual data section or sections. Inanother embodiment the hierarchical algorithm may develop intermediatesections, such as a section to be placed between two received sectionsof visual data. In yet another embodiment, the hierarchical algorithmany be used to increase the quality of the received visual data bycombining the above mentioned embodiments.

These embodiments can be used in combination with other embodiments, andalternative and optional portions of embodiments, described elsewhere inthis specification.

In some embodiments, one or more hierarchical algorithms may be used toestimate higher-resolution versions of received lower-resolution frames.In such embodiments, upon receiving multiple lower-resolution frames, ahierarchical algorithm can be used to estimate a higher resolutionversion of a particular received frame. In some embodiments, on thereceipt of three or more consecutive frames of lower-resolution visualdata a hierarchical algorithm may be used to estimate a higherresolution version of one of the middle frames. In such embodiments,this estimation can be based not only on the lower-resolution version ofthe received frame, but also the lower-resolution version of theprevious and subsequent frames also received. Alternatively, in otherembodiments the hierarchical algorithm can be used to determine anunknown intermediate frame at the same resolution as previous andsubsequent received frames.

Alternatively, in some other embodiments a hierarchical algorithm may beused to estimate higher-resolution versions of the receivedlower-resolution frames, as well as a higher-resolution version of anunknown intermediate frame. Furthermore, in some embodiments thehierarchical algorithm may also be used to estimate an unknown future orpast frame based upon the received lower-resolution frames.

Online Training

In some embodiments, new visual data being transmitted from a node toone or more other nodes has no hierarchical algorithms trained toenhance a lower-quality version of the new visual data. For example, insome embodiments this new visual data may be live broadcast video dataand in some embodiments the new visual data may be streamed or renderede-gaming video content. Where there exist no hierarchical algorithms forthis new visual data, specific or generic hierarchical algorithms needto be trained in order to enhance lower-quality versions of the newvisual data in some of these embodiments and as per some of theembodiments described elsewhere.

In some embodiments, multiple hierarchical algorithms can be trained inparallel on the same visual data. In such embodiments, this allows forwider range of hierarchical algorithms to be explored within a giventimeframe. In some of these embodiments, the most suitable algorithmfrom these developed algorithms can be selected for transmission acrossthe network with the visual data. In some embodiments, developing thehierarchical algorithms in parallel can be useful in situations wherethere is only a limited time available to develop the hierarchicalalgorithm.

In parallel to the development of hierarchical algorithms (whethersingly or multiple in parallel), in some embodiments the visual data canbe encoded in an encoder in preparation for its transmission across thenetwork. In this way, the time taken to prepare both the hierarchicalalgorithm and the visual data for transmission can be reduced whencompared to developing the hierarchical algorithm and encoding thevisual data in series in such embodiments.

Once generic or specific hierarchical algorithms have been developed ortrained, for example for a new game being streamed as e-gaming videocontent, these can be used to enhance the quality of lower-qualitystreamed visual data at receiving nodes.

These embodiments can be used in combination with other embodiments, andalternative and optional portions of embodiments, described elsewhere inthis specification

Offline Training

In some embodiments, new visual data to be transmitted from a node toone or more other nodes has no hierarchical algorithms trained toenhance a lower-quality version of the new visual data. For example, insome embodiments this new visual data may be new video data such as anew film or television series and in some embodiments the new visualdata may be a computer game that will in the future be used to generatestreamed e-gaming video content. Where there exist no hierarchicalalgorithms for this new visual data, specific or generic hierarchicalalgorithms need to be trained in order to enhance lower-quality versionsof the new visual data in some of these embodiments and as per some ofthe embodiments described elsewhere.

Often, the visual data will be encoded prior to transmission across thenetwork using an encoder in certain embodiments. The encoding processmay introduce encoder specific artefacts to the visual data in suchembodiments. By refining the hierarchical algorithm by performingfurther training steps on the encoded video in some embodiments, thehierarchical algorithm can be trained to substantially correct imageartefacts introduced by the encoder.

In some embodiments the hierarchical algorithms can be trained usingtraining data corresponding to the exact visual data that will betransmitted across the network. In such embodiments, this approach canbe particularly useful in situations where the visual data is known inadvance, and where the visual data is likely to be transmitted acrossthe network multiple times. For example, in some embodiments thehierarchical models can be trained on sections of an episode of a TVprogram that will be made available on an on-demand streaming service.In such embodiments the models trained on that particular episode can betransmitted alongside the lower-quality visual data and be used toenhance the lower-quality visual data to a higher-quality version ofthat episode.

Alternatively, in other embodiments the hierarchical algorithms can betrained on training data that is similar, but not identical, to theexpected visual data on which they are to be used. In such embodimentthese trained models can be associated with metric data relating toproperties of the visual data on which they were trained. In some ofthese embodiments, this metric data can later be used to select anappropriate hierarchical algorithm to use to enhance visual data forwhich no specific model has been trained. In some embodiments visualdata is being generated and transmitted across the network substantiallysimultaneously, for example during a live broadcast. In suchembodiments, there may not be enough time to generate a specifichierarchical algorithm for the visual data without introducing asubstantial delay to the live broadcast. In such embodiments, selectinga hierarchical algorithm that has been pre-trained on similar visualdata can reduce this delay.

Once hierarchical algorithms have been trained in order to enhancelower-quality versions of the new visual data these can be stored inorder to be sent with the visual data or distributed to receiving nodesin advance of visual data being sent, depending on the embodiments.

These embodiments can be used in combination with other embodiments, andalternative and optional portions of embodiments, described elsewhere inthis specification.

Strided Convolutions

Optionally, FIG. 18 shows an alternative method 1800 of the method 1500shown in FIG. 15 according to some embodiments. In these embodiments,once the visual data 1510 has been separated into individual frames atstep 1520, the dimension of the full resolution images 2110 extractedmay be reduced based on at least one predetermined factor at step 1810.In these embodiments, at step 1810, the at least one predeterminedfactor may be used to select individual pixels from the extracted fullresolution images 2110 to form a lower resolution representation 2120 ofthe extracted full resolution images 2110. For example, in someembodiments, a predetermined factor of 2 may indicate every other pixelin both the horizontal and vertical dimensions is selected, as shown inFIG. 21. It will be appreciated that other values of the predeterminedfactor may be used in other embodiments, furthermore in some of theseother embodiments both the horizontal and vertical dimensions may eachhave a different predetermined factor applied.

In some embodiments, the reduced dimension visual data may beconcatenated in step 1820, to form a lower resolution representation2120 of the extracted full resolution images 2110. In these embodiments,the lower resolution representation 2120 can then be used as a basis forany image enhancement techniques and analysis allowing for the use oflarger super resolution networks without compromising the runtime. Insome embodiments, different predetermined factors and sizes of superresolution network can be used to obtain optimum performance.

Alternatively, in other embodiments, FIG. 19 shows a method 1900 basedupon the method 1600 shown in FIG. 16. In method 1900 of these otherembodiments, steps 1810 and 1820 can occur after the frames are groupedinto scenes in step 1610.

Referring now to FIG. 20, a modified process 2000 according to someembodiments (based on process 1900 but which could equally be a modifiedversion of process 1800) is shown.

In these embodiments, process 1900 is modified with further steps.Specifically, in some of these embodiments, step 1710 can begin with ahigh resolution visual data, for example at HD resolution. Then, at step1720 of these embodiments, the visual data can be down-sampled to, forexample, SD resolution to enable transmission over abandwidth-restricted network. At step 1730 of these embodiments, thelower-resolution visual data can be transmitted over a network thusbecoming the input visual data 310 of either process 1800 or 1900described above in relation to FIG. 18 or 19 respectively.

Specific Description—Flexibility of Described Aspects and Embodiments

Any system feature as described herein may also be provided as a methodfeature, and vice versa.

As used herein, means plus function features may be expressedalternatively in terms of their corresponding structure.

In particular, method aspects may be applied to system aspects, and viceversa.

Furthermore, any, some and/or all features in one aspect can be appliedto any, some and/or all features in any other aspect, in any appropriatecombination.

It should also be appreciated that particular combinations of thevarious features described and defined in any aspects of disclosedimplementations can be implemented and/or supplied and/or usedindependently.

In alternative embodiments, the input visual data concerned may be mediafor playback, such as recorded visual data or live streamed visual data,or it can be videoconference video or any other visual data source suchas video recorded or being recorded on a portable device such as amobile phone or a video recording device such as a video camera orsurveillance camera.

It should also be appreciated that the term ‘visual data’, may refer toa single image, a sequence of images, video, or a section of visualdata.

It should further be appreciated that the term “enhancing” may refer toupscaling, increasing the resolution and/or quality of visual data.References to enhancing or increasing the quality of visual data canrefer to upscaling or using enhancement techniques of the possibleembodiments described. References to down sampling can refer to reducingthe resolution and/or quality of visual data (for example byquantisation to lower the bit rate of the visual data).

It should also be appreciated that the term ‘frame’, particularly inreference to grouping multiple frames into scenes, can refer to both anentire frame of a video and an area comprising a smaller section of aframe.

In aspects and/or embodiments, the terms algorithms and/or models and/orparameters can be used interchangeably or exchanged with each other.Further, in aspects and/or embodiments, the terms hierarchicalalgorithm, hierarchical model and hierarchical parameter can beexchanged with the terms convolutional neural networks and/orconvolutional neural network model, convolutional neural networkalgorithm, convolutional neural network parameter.

What is claimed is:
 1. A method for training learned hierarchicalalgorithms, the method comprising the steps of: receiving input data;generating metrics from the input data; selecting at least onehierarchical algorithm from a plurality of predetermined hierarchicalalgorithms based on comparing the generated metrics from the input dataand like metrics for each of the plurality of predetermined hierarchicalalgorithms; developing the at least one hierarchical algorithm based onthe input data; and outputting a developed hierarchical algorithm. 2.The method of claim 1, wherein the plurality of predeterminedhierarchical algorithms is selected from the group including:pre-trained hierarchical algorithms on example data; and manuallycreated hierarchical algorithms.
 3. The method of claim 1, wherein thehierarchical algorithm is selected from the group including: a specificparameter for the reconstruction of data; and a mapping function for thereconstruction of data.
 4. The method of claim 1, wherein the metricsare based on generating the highest quality output data, preferablywherein quality can be defined using a selection from the groupincluding: an error rate; a peak signal-to-noise ratio; a distancemetric; a similarity measure; and a structural similarity index.
 5. Themethod of claim 1, wherein the developed hierarchical algorithm istrained using a learned approach.
 6. The method of claim 5, wherein thelearned approach comprises machine learning techniques.
 7. The method ofclaim 1, wherein the hierarchical algorithm is a non-linear hierarchicalalgorithm.
 8. The method of claim 1, wherein the hierarchical algorithmperforms image enhancement, preferably using super-resolutiontechniques.
 9. The method of claim 1, wherein the hierarchical algorithmuses a spatio-temporal approach.
 10. The method of claim 1, wherein thehierarchical algorithm comprises a plurality of layers, wherein thelayers are selected from the group including: sequential, recurrent,recursive, branching, and merging.
 11. A method for training machinelearning models or parameters, the method comprising the steps of:receiving input data; generating metrics from the input data; selectingat least one example-based set of parameters from a plurality ofpredetermined example-based sets of parameters based on comparing thegenerated metrics from the input data and like metrics for each of theplurality of predetermined example-based sets of parameters; developingthe at least one example-based set of parameters based on the inputdata; and outputting a developed example-based set of parameters. 12.The method of claim 11, further comprising the step of: storing thedeveloped example-based set of parameters with the predeterminedexample-based sets of parameters along with the generated metrics fromthe input data.
 13. The method of claim 11, wherein developing the atleast one example-based set of parameters is based on the input datacomprises developing a more optimised example-based set of parameters.14. The method of claim 11, wherein the set of parameters is selectedfrom the group including: a convolutional neural network; a non-linearhierarchical algorithm; a dictionary learning algorithm; a parameter;and a mapping function.
 15. The method of claim 11, comprising thefurther steps of: extracting features of the input data; and using theextracted features to select a predetermined example-based set ofparameters from the plurality of predetermined example-based sets ofparameters to provide initial parameters for the developed example-basedset of parameters.
 16. The method of claim 11, wherein the predeterminedexample-based sets of parameters is any of: pre-trained example-basedsets of parameters on example data; and manually created example-basedsets of parameters.
 17. The method of claim 11, wherein theexample-based set of parameters is selected based on providing optimalinitialisation data when in use.
 18. The method of claim 11, wherein asection of visual data comprises any of: a single frame of visual data,a sequence of frames of visual data, and a region within a frame orsequence of frames of visual data.
 19. The method of claim 11, whereinthe plurality of predetermined example-based sets of parameters isstored in a repository.
 20. A computer program product embodied on anon-transitory storage medium and comprising instructions that, whenexecuted, cause a system to train learned hierarchical algorithms, byperforming the steps of: receiving input data; generating metrics fromthe input data; selecting at least one hierarchical algorithm from aplurality of predetermined hierarchical algorithms based on comparingthe generated metrics from the input data and like metrics for each ofthe plurality of predetermined hierarchical algorithms; developing theat least one hierarchical algorithm based on the input data; andoutputting a developed hierarchical algorithm.